mediumGreedyPure DSA~25 min
Minimum Jumps to Reach the Last Index
Standing on the first cell of a row, each cell tells the maximum forward jump allowed from it. Reach the last cell in the fewest jumps.
Problem
Given an integer array nums where nums[i] is the maximum jump length from index i, return the minimum number of jumps to reach the last index starting from index 0. The test data guarantees the last index is reachable.
Input
An integer array nums of non-negative jump lengths.
Output
An integer: the minimum number of jumps.
Constraints
- 1 <= nums.length <= 10^4
- 0 <= nums[i] <= 1000
- The last index is always reachable.
Examples
Example 1
Input
nums = [2,3,1,1,4]
Output
2
Jump 1 step to index 1, then 3 steps to the last index.
Example 2
Input
nums = [2,3,0,1,4]
Output
2
Index 0 → 1 → 4 in two jumps.