You are given a binary string s indexed from $0$, along with two integers minJump and maxJump. You are initially positioned at index $0$, where s[0] is guaranteed to be '0'.

In each move, you can jump from your current index i to a target index j if both of the following conditions hold:

• i + minJump $\leq$ j $\leq \min($i + maxJump, s.length $- 1)$

• s[j] == '0'

Return true if you can reach index s.length $- 1$, or false otherwise.

Constraints:

• $2 \leq$ s.length $\leq 10^5$

• s[i] is either '0' or '1'.

• s[0] == '0'

• $1 \leq$ minJump $\leq$ maxJump $<$ s.length

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.