Leetcode 2193. Minimum Number of Moves to Make Palindrome

Given a lowercase string s (length ≤ 2000) that can be rearranged into a palindrome, compute the minimum number of adjacent swaps needed to transform s into any palindrome. The core challenge is optimally pairing matching characters from the ends (equivalently mapping to a target palindrome permutation) to minimize adjacent swaps.