AlgoLounge

Jump Game

medium

You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position.

Return true if you can reach the last index, or false otherwise.

Examples

Example 1

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

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

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.

Constraints

  • 1 <= nums.length <= 10^4
  • 0 <= nums[i] <= 10^5
TypeScript
Loading editor…
List of test cases (13)
Case 1
nums = [2,3,1,1,4]
Case 2
nums = [3,2,1,0,4]
Case 3
nums = [0]
Case 4
nums = [1,0,0]
Case 5
nums = [2,0,0]
Case 6
nums = [1,1,1,1]
Case 7
nums = [5,0,0,0,0,0]
Case 8
nums = [2,5,0,0]
Case 9
nums = [1,2,3]
Case 10
nums = [0,1]
Case 11
nums = [1,0,1,0]
Case 12
nums = [2,0,1,0,1]
Case 13
nums = [3,0,8,2,0,0,1]