Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Game Play Analysis III
Coding
- Jump Game
Coding · Array · Dynamic Programming · Greedy
- Jump Game II
Coding · Array · Dynamic Programming · Greedy
- Jump Game IV
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Amazon
Leetcode 1306. Jump Game III
Reported Oct 8, 2024 · 1 source report
INTERN
Source snapshot: Nov 12, 2026
View source