[Golang] Sliding Window
Complexity\n- Time complexity:\nO(N)\n\n- Space complexity:\nO(N)\n\n# Code\n\nfunc canReach(s string, minJump int, maxJump int) bool {\n    n := len(s)\n    dp
# Complexity\n- Time complexity:\nO(N)\n\n- Space complexity:\nO(N)\n\n# Code\n```\nfunc canReach(s string, minJump int, maxJump int) bool {\n    n := len(s)\n    dp := make([]bool, n)\n    dp[0] = true\n\n    count := 0\n    for i := minJump; i < n; i++ {\n        if dp[i-minJump] {\n            count++\n        }\n        if i > maxJump && dp[i-maxJump-1] {\n            count--\n        }\n        if s[i] == \'0\' && count > 0 {\n            dp[i] = true\n        }\n    }\n    return dp[n-1]\n}\n```
['Go']