Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1871. Jump Game VII
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.