✅𝗘𝗔𝗦𝗬  𝗗𝗣 𝗔𝗣𝗣𝗥𝗢𝗔𝗖𝗛 || 𝗨𝗦𝗜𝗡𝗚 𝗖++✔✔
\n\n    class Solution {\n    public:\n\t\n       bool canReach(string s, int minJump, int maxJump) {\n            int n=s.size(),l=0,u; \n            vector dp
\n\n    class Solution {\n    public:\n\t\n       bool canReach(string s, int minJump, int maxJump) {\n            int n=s.size(),l=0,u; \n            vector<bool> dp(n,false);\n            dp[0]=true;\n         \n            for(int i=0;i<n;i++){\n                if(!dp[i]) continue;\n                u=min(i+maxJump,n-1);   \n               for(int j=max(l,i+minJump);j<=u;j++) \n                if(s[j]==\'0\') dp[j]=true;\n               l=u+1; \n             }\n            return dp[n-1];\n        }\n    };
['Dynamic Programming', 'C++']