Easy Solution || Beats 90% || Faster than others
\n\n# Code\n\nclass Solution {\npublic:\n    string reverseStr(string s, int k) {\n        int l=0,h=k-1;\n        \n        while(l<s.length()){\n            i
\n\n# Code\n```\nclass Solution {\npublic:\n    string reverseStr(string s, int k) {\n        int l=0,h=k-1;\n        \n        while(l<s.length()){\n            int start=l;\n            if(h>=s.length())h=s.length()-1;\n            while(l<=h){\n                swap(s[l],s[h]);\n                l++;\n                h--;\n            }\n            l=start+2*k;\n            h=l+k-1;\n        }\n        return s;\n        \n    }\n};\n```
['C++']