Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Minimum Insertion Steps to Make a String Palindrome
Coding
- Minimum Moves to Make Array Complementary
Coding
- Minimum Number of Changes to Make Binary String Beautiful
Coding
- Minimum Number of Days to Make m Bouquets
Coding · Array · Binary Search
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2193. Minimum Number of Moves to Make Palindrome
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source