[C++] - Sliding Window standard problem
\nclass Solution {\npublic:\n    int equalSubstring(string s, string t, int maxCost) {\n        int currCost=0;\n        int len=s.length();\n        int low=0;
```\nclass Solution {\npublic:\n    int equalSubstring(string s, string t, int maxCost) {\n        int currCost=0;\n        int len=s.length();\n        int low=0;\n        int max_len=0;\n        \n        for(int i=0;i<len;i++){\n            currCost+=abs(s[i]-t[i]);\n            \n            while(low<=i && currCost>maxCost){\n                currCost-=abs(s[low]-t[low]);\n                low++;\n            } \n            max_len=max(max_len,i-low+1);\n        }\n        return max_len;\n    }\n    \n};\n```
['C', 'Sliding Window', 'C++']