Jump Game II
You are given a 0-indexed array of integers nums of length n. You are initially positioned at nums[0]. Each element nums[i] represents the maximum length of a forward jump from index i. Return the minimum number of jumps to reach nums[n - 1].

30:00

Jump Game II
medium
Topics
Companies

You are given a 0-indexed array of integers nums of length n. You are initially positioned at nums[0]. Each element nums[i] represents the maximum length of a forward jump from index i. Return the minimum number of jumps to reach nums[n - 1].

Example 1:
Input: [2,3,1,1,4]
Output: 2
Constraints:

  • 1≤nums.length≤1041 \leq \text{nums.length} \leq 10^4

  • 0≤nums[i]≤10000 \leq \text{nums}[i] \leq 1000

  • It's guaranteed that you can reach the last index.

Input
arr =[2,3,1,1,4]

Start: window [0,0]

2

LR

3

1

1

4

Jumps

0

Variables
No variables to display
DepthFunction Call
Stack empty
0/8