...

/

Minimum Number of Moves to Make Palindrome

Minimum Number of Moves to Make Palindrome

Try to solve the Minimum Number of Moves to Make Palindrome problem.

We'll cover the following...

Statement

Given a string s, return the minimum number of moves required to transform s into a palindrome. In each move, you can swap any two adjacent characters in s.

Note: The input string is guaranteed to be convertible into a palindrome.

Constraints:

  • ...