def canJump_TLE2(self, A):
        l = len(A)
        dp = [False for _ in xrange(l+1)]  # last one is dummy
        dp[0] = True
        for ind, val in enumerate(A):
            if dp[ind]:
                for i in xrange(1, val+1):  # now jumping
                    if ind+i<l+1:
                        dp[ind+i] = True
                    else:
                        break
        return dp[-1]
Returns md5 hash of file contents.
dataset/ETHPy150Open algorhythms/LeetCode/054 Jump Game.py/Solution.canJump_TLE2--crossover with--dataset/ETHPy150Open BD2KGenomics/toil/src/toil/test/jobStores/jobStoreTest.py/hidden.AbstractJobStoreTest._hashJobStoreFileID