Available question text
Given a sequence and constrained jump rules (e.g., you may jump only within a distance range or according to element values, and some positions may be forbidden), determine whether you can reach the last index — the key challenge is efficiently tracking reachable indices using BFS/DP with sliding-window or prefix-sum optimizations.
Related questions
Continue with questions that share topics or the same question type.
- Jump Game
Coding · Array · Dynamic Programming · Greedy
- Jump Game II
Coding · Array · Dynamic Programming · Greedy
- Jump Game III
Coding
- 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
No company association
Leetcode 2297. Jump Game VIII
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source