C++ 100% Beats.
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    string reverseStr(string s, int k) {\n        int n = s.size();\n        for (int i = 0; i < n; i += 2 * k) {\n            if (i + k <= n) {\n                reverse(s.begin() + i, s.begin() + i + k);\n            } else {\n                reverse(s.begin() + i, s.end());\n            }\n        }\n        return s;\n    }\n};\n```
['C++']