Jump Game VII Python Solution with Tests

lcpy gen -n 1871   # by problem number
lcpy gen -s jump_game_vii   # by problem name

Input: s = "011010", minJump = 2, maxJump = 3
Output: true
Explanation:
In the first step, move from index 0 to index 3.
In the second step, move from index 3 to index 5.

Input: s = "01101110", minJump = 2, maxJump = 3
Output: false

class Solution:
    # Time: O(n)
    # Space: O(n)
    def can_reach(self, s: str, min_jump: int, max_jump: int) -> bool:
        n = len(s)
        if s[n - 1] != "0":
            return False

        reachable = [False] * n
        reachable[0] = True
        window_count = 0

        for i in range(1, n):
            if i >= min_jump and reachable[i - min_jump]:
                window_count += 1
            if i > max_jump and reachable[i - max_jump - 1]:
                window_count -= 1

            if s[i] == "0" and window_count > 0:
                reachable[i] = True

        return reachable[n - 1]