Available question text
Given a binary string s and integers minJump and maxJump, determine whether you can reach the last index from index 0 by repeatedly jumping from i to any j in [i+minJump, min(i+maxJump, n-1)] where s[j] == '0'. The core challenge is efficiently deciding reachability over large n (up to 1e5) despite overlapping range-limited moves.
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 1871. Jump Game VII
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source