Skip to main content
Back to ChallengesJump GameMedium 30 min

Jump Game

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

Input: nums = [2,3,1,1,4]
Output: true
Jump 1 step from index 0 to 1, then 3 steps to the last index.
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

Complexity Analysis

Time
O(N)
iterating through the array once.
Space
O(1)
constant extra space.

Test Cases

#1 Reachable
Input: nums = [2,3,1,1,4]
Expected: true
#2 Blocked by 0
Input: nums = [3,2,1,0,4]
Expected: false
Output
Click "Run Code" to see output here...