Jump Game - Leetcode 55 - Dynamic Programming (Python)

Please check my playlists for free DSA problem solutions:

My Favorite Courses:

Data Structures & Algorithms:

Python:

Web Dev / Full Stack:

Cloud Development:

Game Development:

SQL & Data Science:

Machine Learning & AI:

[GregHogg]

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

[mjanish]

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

[tkbeast...]

Really helpful to understand the concepts ❤

[lgyfxxn]

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?

[saignanadeep]

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

return false