Minimum adjacent swaps to make a string a palindrome
Filed under Larsen & Toubro
The question
Find the minimum number of adjacent swaps required to convert a given string into a palindrome, or determine if it is not possible.
No write-up yet. Related questions below have one.
Related Larsen & Toubro questions
Collected from public candidate posts and coding forums. Updated Nov 2026.