Time: 364 ms (47.02%), Space: 17.8 MB (36.47%) - LeetHub

Author: Deepak5113

0055-jump-game/0055-jump-game.py

@@ -0,0 +1,8 @@
+class Solution:
+    def canJump(self, nums: List[int]) -> bool:
+        max_reach = 0
+        for i, num in enumerate(nums):
+            if i > max_reach:
+                return False
+            max_reach = max(max_reach, i + num)
+        return max_reach >= len(nums) - 1