Easy to understand Python solution to reverse string
\n# Complexity\n- Time complexity:\n Add your time complexity here, e.g. O(n) \nO(n)\n- Space complexity:\n Add your space complexity here, e.g. O(n) \nO(n)\n# 
\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\nO(n)\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\nO(n)\n# Code\n```\nclass Solution:\n    def reverseStr(self, s: str, k: int) -> str:\n        l = list(s)\n        for i in range(0, len(l), 2 * k):\n            start = i\n            end = min(i + k - 1, len(l) - 1) \n            while start < end:\n                l[start], l[end] = l[end], l[start]\n                start += 1\n                end -= 1\n\n        return \'\'.join(l)\n\n```
['Two Pointers', 'String', 'Python3']