 All Problems
Jump Game
medium
array
dynamic programming
greedy
amazon
microsoft
google

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.

Example 1:

Input:  2 3 1 1 4
Output: true

Example 2:

Input:  3 2 1 0 4
Output: false

Constraints:

  • 1 ≤ nums.length ≤ 10⁴
  • 0 ≤ nums[i] ≤ 10⁵

Input format: Space-separated integers.

Output format: true or false.

Run to check your code against the sample cases, or submit to run every case