Skip to main content
Admissions guidance, study banks, and career tools — get started on Shalyam

Jump Game II

Starting at index 0, nums[i] is the maximum jump length from index i. Print the minimum number of jumps needed to reach the last index (it is always reachable).

Constraints

1 <= n <= 10^4 0 <= nums[i] <= 1000

Discussion

No discussions yet.

Rewards · v2.1

Get Exclusive Insights with Every Issue

Join Shalyam Newsletter

Stay ahead in education, research, and innovation—straight to your inbox.