Available question text
Find the minimum number of jumps to reach x using jumps of +a or -b while avoiding forbidden positions and disallowing two consecutive backward jumps; this is a shortest-path problem on an implicit graph requiring BFS over states (position, last-move-was-back) with bounds to prevent infinite exploration.
Related questions
Continue with questions that share topics or the same question type.
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
No company association
Leetcode 1654. Minimum Jumps to Reach Home
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source