Greedy AlgorithmsJump Game

solution.py

⌘↵ run

Jump Game

medium

You've got this! Start small, think out loud.

Given an integer array `nums` where `nums[i]` is the maximum jump length from position i, return true if you can reach the last index from index 0.

Time:O(n)

Space:O(1)

greedygoogle-favorite

OUTPUT

Run your code to see output