2193. Minimum Number of Moves to Make Palindrome

You are given a string s consisting only of lowercase English letters. In one move, you can select any two adjacent characters of s and swap them. Return the minimum number of moves needed to make s a palindrome. Note that the input will be generated such that s can always be converted to a palindrome. Example 1: Input: s = "aabb" Output: 2 Explanation: We can obtain two palindromes from s,