C++ SIMPLE CLEAN BFS SOLUTION
\nclass Solution {\npublic:\n\n    bool canReach(string s, int minJump, int maxJump) {\n     \n        queue<int>q;\n        int prev=0;\n        q.push(0);\n  
```\nclass Solution {\npublic:\n\n    bool canReach(string s, int minJump, int maxJump) {\n     \n        queue<int>q;\n        int prev=0;\n        q.push(0);\n        \n        while(q.size()>0)\n        {\n            int a=q.front();\n            q.pop();\n            if(a==s.length()-1)\n            {\n                return 1;\n            }      \n            for(int i=max(a+minJump,prev);i<=min(a+maxJump,(int)s.length()-1);i++)\n            {\n                if(s[i]==\'0\')\n                   q.push(i);\n            }\n            prev=min(a+maxJump,(int)s.length()-1)+1;\n        }\n        \n        return 0;       \n    }\n};\n```
['Breadth-First Search', 'C']