Medium

Quiz

#55 Jump Game

APPROACH

Each element of integer array nums represents the maximum forward jump length from that index. Starting at index 0, return true if the last index is reachable, false otherwise.

Example 1:

Input: nums = [2,3,1,1,4]

Output: true

Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.

Example 2:

Input: nums = [3,2,1,0,4]

Output: false

Explanation: You will always arrive at index 3 no matter what. Its maximum jump length is 0, which makes it impossible to reach the last index.

1 of 4

1:00

What is the optimal approach for this problem?