Simple Easy Concise BFS C++
Each zero can be considered a node and can explore nodes(zeroes) in range of (i+minJump, i + maxJump)\n\n```\n    bool canReach(string s, int minJump, int maxJu
Each zero can be considered a node and can explore nodes(zeroes) in range of (i+minJump, i + maxJump)\n\n```\n    bool canReach(string s, int minJump, int maxJump) {\n        \n        vector<bool> visited(s.size(), false);\n        queue<int> q;\n        q.push(0);\n        \n\n        int farthest = 0;\n        while(!q.empty()) {\n            int t = q.front();\n            q.pop();\n            if(visited[t]) {\n                continue;\n            }\n            visited[t] = true;\n\n            for(int i = max(farthest, t + minJump); i <=  min(t + maxJump, (int)s.length() - 1) ; i++) {\n                if(!visited[i] && s[i] == \'0\'){\n                    q.push(i);\n                }\n            }\n            \n            farthest = max(fathest, t + maxJump);\n        }\n        \n        return visited[s.size() - 1];\n    }\n\t
[]