Problem 2193 · Hard

Minimum Number of Moves to Make Palindrome

Rearrange the characters of a string into a palindrome using the fewest adjacent swaps. The visual pairs the outer characters and brings matching characters together one swap at a time.

Open the interactive visualisation