Jump Game - Leetcode 55 - Dynamic Programming (Python)

[@GregHogg]

Master Data Structures & Algorithms For FREE at AlgoMap.io!

[@mjanish9836]

I am shocked that this is Working and moreover I am flabbergasted because I understood

[@tkbeast...7797]

Really helpful to understand the concepts ❤

[@GregHogg]

Glad to hear it!

[@user-lg9yf7xx2n]

Hey I had one question...for the base case if i == n-1: we return True.. but what if at last index we have a zero?

[@user-lg9yf7xx2n]

Oh I think it doesn't matter even if the value is 0.. we just need to check if we can reach the last index or not

[@saignanadeep670]

What about this approach: max=nums[0] for i->1,n if max>=n return True if max

[@shihabhasan8959]

Great