Jump Game

IF
AlgoAxiomStaff Engineers
JSTS
Medium20 mins

Given an integer array nums, where each element represents your maximum jump length at that position, determine if you can reach the last index starting from the first index.

Examples

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, so you can never reach the last index.

Example 3:

Input: nums = [0]

Output: true

Explanation: You are already at the last index.

Constraints

  • 1 <= nums.length <= 10^4
  • 0 <= nums[i] <= 10^5
Source: Greedy Techniques pattern — AlgoAxiom
JavaScript
Test Case 1
root = [1, 2, 3]
Test Case 2
root = [1, 2, 3, 4, 5]
Idle