<p>You are given a <strong>0-indexed</strong> binary string <code>s</code> and two integers <code>minJump</code> and <code>maxJump</code>. In the beginning, you are standing at index <code>0</code>, which is equal to <code>&#39;0&#39;</code>. You can move from index <code>i</code> to index <code>j</code> if the following conditions are fulfilled:</p>

<ul>
	<li><code>i + minJump &lt;= j &lt;= min(i + maxJump, s.length - 1)</code>, and</li>
	<li><code>s[j] == &#39;0&#39;</code>.</li>
</ul>

<p>Return <code>true</code><i> if you can reach index </i><code>s.length - 1</code><i> in </i><code>s</code><em>, or </em><code>false</code><em> otherwise.</em></p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;<u>0</u>11<u>0</u>1<u>0</u>&quot;, minJump = 2, maxJump = 3
<strong>Output:</strong> true
<strong>Explanation:</strong>
In the first step, move from index 0 to index 3. 
In the second step, move from index 3 to index 5.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;01101110&quot;, minJump = 2, maxJump = 3
<strong>Output:</strong> false
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>2 &lt;= s.length &lt;= 10<sup>5</sup></code></li>
	<li><code>s[i]</code> is either <code>&#39;0&#39;</code> or <code>&#39;1&#39;</code>.</li>
	<li><code>s[0] == &#39;0&#39;</code></li>
	<li><code>1 &lt;= minJump &lt;= maxJump &lt; s.length</code></li>
</ul>

class Solution:
    def canReach(self, s: str, minJump: int, maxJump: int) -> bool:

        l, r = minJump, maxJump
        n = len(s)
        set_ = ([0])
        list_ = [0]

        if s[-1] == '1':
            return False

        max_ = 0

        while set_:
            new_set = set()
            new_list = []
            for idx in list_:
                if s[idx] == '0': 
                    for tujuan in range(idx+minJump if max_ < idx+minJump else max_ + 1, idx+maxJump+1):
                        if tujuan == n-1 and s[tujuan] == '0':
                            return True

                        if tujuan not in set_ and tujuan <= n-1 and s[tujuan] == '0':
                            new_set.add(tujuan)
                            new_list.append(tujuan)

                        max_ = max(max_, tujuan)

            set_ = new_set.copy()
            list_ = new_list.copy()

        return False




        while l <= r:
            r_next = r
            l_next = None

            for i in range(l,r+1):

                if s[i] == '0':

                    if i == n-1:
                        print('di atas')
                        return True

                    r_next = i + maxJump

                    if i + minJump > r and l_next == None:
                        l_next = i + minJump

                    elif i + minJump <= r and l_next == None:
                        l_next = r + 1


            l = l_next if l_next else r+1
            r = n-1 if r_next >= n-1 else r_next

            if l <= n-1 <= r:
                print('di bawah')
                return True
            

        return False
319