Solving Reverse String II in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Given a string and an integer k, you need to reverse the first k characters for every 2k characters counting from the start of the string. If there are less than k characters left, reverse all of them. If there are less than 2k but greater than or equal to k characters, then reverse the first k characters and left the other as original.


Input: s = "abcdefg", k = 2
Output: "bacdfeg"


  1. The string consists of lower English letters only.
  2. Length of the given string and k will in the range [1, 10000]

See the full details of the problem Reverse String II at LeetCode

Originally posted at: