Jump Game II
Medium
Greedy (Advanced)
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.
Shalyam Support
Hi! Ask us anything — we'll reply on WhatsApp or Telegram within 24 hours.