Cuber QQ wants to change the initial string to the string which is made from repetition through swapping adjacent characters in the string.s can be obtained by concatenating two identical strings. Cuber QQ wants to know the least possible number of swaps of adjacent characters to make the string into the string which is made from repetition.
As usual, Cuber QQ will come up with a string-related problem to trouble you. Cuber QQ wants to change the initial string to the string which is made from repetition through swapping adjacent characters in the string. The string s s which is made from repetition satisfies that s s can be obtained by concatenating two identical strings x x, i.e., s=xx s=xx. Cuber QQ wants to know the least possible number of swaps of adjacent characters to make the string into the string which is made from repetition.