Easiest C++ Solution | Simple O(N)
\nclass Solution {\npublic:\n    bool canReach(string s, int minJump, int maxJump) {\n        int n = s.length();\n        int curr_i = 0;\n        for(int i=0;
```\nclass Solution {\npublic:\n    bool canReach(string s, int minJump, int maxJump) {\n        int n = s.length();\n        int curr_i = 0;\n        for(int i=0;i<n;i++){\n            if(s[i]==\'0\'&&curr_i+minJump<=i&&i<=min(curr_i+maxJump,n-1))   curr_i = i;\n            if(s[n-1]==\'0\'&&curr_i+minJump<=n-1&&n-1<=min(curr_i+maxJump,n-1))   return true;\n        }return false;\n    }\n};\n```
[]