Easy DP Solution C++ || Faster than 100%
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    bool canReach(string s, int mn, int mx) {\n        int n=s.size();\n\n        int a=0,b;\n\n        vector<bool>dp(n,false);\n\n        dp[0]=true;\n\n        for(int i=0;i<n;i++){\n            if(!dp[i]) continue;\n\n            b=min(i+mx,n-1);\n\n            for(int j=max(a,i+mn);j<=b;j++){\n                if(s[j]==\'0\') dp[j]=true;\n            }\n            a=b+1;\n        }\n        return dp[n-1];\n    }\n};\n```
['String', 'Dynamic Programming', 'Sliding Window', 'Prefix Sum', 'C++']