Minimum Number of Moves to Make Palindrome

Explore how to determine the minimum number of moves required to convert a string into a palindrome by swapping adjacent characters. Understand and apply the two pointers approach to efficiently solve this problem within linear constraints.