30% off Lifetime Premium Access expires December 2nd!

30% off Lifetime Premium Access expires Dec 2nd!

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Get Premium

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.

Company

Level

Region

Early September, 2024

Amazon

Junior

Extension of Jump Game: Return the path to reach the end of the array

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 45. Jump Game II

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact