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 1306. Jump Game III

Given an array and a start index, determine whether you can reach any index with value 0 by repeatedly jumping from index i to i + arr[i] or i - arr[i] without leaving the array. This is a reachability problem on an implicit graph of indices (edges i ↔ i ± arr[i]) that can be solved by exploring reachable indices while avoiding cycles.

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 October, 2024

Amazon

Intern

Jump Game III - Determine if it's possible to reach any index with a value 0

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 1306. Jump Game III

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact