Python 20ms Solution Brute Force
\nclass Solution:\n    def reverseStr(self, s: str, k: int) -> str:\n        n, i, ans, flag = len(s), 0, "", 1\n        while i<n:\n            if flag==1:\n  
```\nclass Solution:\n    def reverseStr(self, s: str, k: int) -> str:\n        n, i, ans, flag = len(s), 0, "", 1\n        while i<n:\n            if flag==1:\n                ans += s[i:i+k][::-1]\n            else:\n                ans += s[i:i+k]\n            i = i+k\n            flag = 1-flag\n        return ans\n```
[]