easy python solution beat 98% time and 100% space
\n\ndef reverseStr(self, s: str, k: int) -> str:\n        L = len(s)\n        if L<k: return s[::-1]\n        if L>k and L<=k*2:\n            return s[:k][::-1]
![image](https://assets.leetcode.com/users/jefferyzzy/image_1579246537.png)\n```\ndef reverseStr(self, s: str, k: int) -> str:\n        L = len(s)\n        if L<k: return s[::-1]\n        if L>k and L<=k*2:\n            return s[:k][::-1]+s[k:]\n        ans = \'\'\n        for i in range(0,L,2*k):\n            ans+=(s[i:i+k][::-1]+s[i+k:i+2*k])\n        return ans\n```
['Python', 'Python3']