1871. Jump Game VII

LeetCodeStringDynamic ProgrammingSliding WindowPrefix SumOpen on judge ↗

You are given a 0-indexed binary string s and two integers minJump and maxJump. In the beginning, you are standing at index 0, which is equal to '0'. You can move from index i to index j if the following conditions are fulfilled: - i + minJump <= j <= min(i + maxJump, s.length - 1), and - s[j] == '0'. Return true if you can reach index s.length - 1 in s, or false otherwise. Example 1: Input

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI