Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.