Leetcode 45. Jump Game II
Given an array where nums[i] is the maximum forward jump from index i, compute the minimum number of jumps needed to reach the last index by optimally choosing jumps within overlapping reachable ranges; n ≤ 10^4 and it's guaranteed the last index is reachable.
Asked at:
Amazon
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
Mid September, 2026
Senior
Jump game II but to return array of choices
Early September, 2024
Junior
Extension of Jump Game: Return the path to reach the end of the array
Hello Interview Premium
Your account is free and you can post anonymously if you choose.