Python Easy Solution Faster than 98.86 %
\nclass Solution:\n    def reverseStr(self, s: str, k: int) -> str:\n        for i in range(0,len(s),2*k):\n            if(i+k<len(s)):\n                s=s[0:i
```\nclass Solution:\n    def reverseStr(self, s: str, k: int) -> str:\n        for i in range(0,len(s),2*k):\n            if(i+k<len(s)):\n                s=s[0:i]+s[i:i+k][::-1]+s[i+k:]\n            else:\n                s=s[0:i]+s[i:i+k][::-1]\n        return s\n```
['Python']