Simple and easy - faster than 99.52%
\nclass Solution:\n    def reverseStr(self, s: str, k: int) -> str:\n        s=list(s)\n        for i in range(0,len(s),2*k):\n            if len(s[i:i+k])<k:\n
```\nclass Solution:\n    def reverseStr(self, s: str, k: int) -> str:\n        s=list(s)\n        for i in range(0,len(s),2*k):\n            if len(s[i:i+k])<k:\n                s[i:i+k]=s[i:i+k][::-1]\n            elif 2*k>len(s[i:i+k])>=k:\n                s[i:i+k]=s[i:i+k][::-1]\n        return "".join(s)\n```\nI think the code is pretty self explanatory, however if any doubts please ask!!!\nIf you like, please **UPVOTE**\nHappy Coding!!!
['Python', 'Python3']