← Paytm questions

Count Minimum Swaps to Make String Palindrome

Filed under Paytm

Given a string, find the minimum number of adjacent swaps required to make it a palindrome. If it is impossible, return -1.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Paytm questions

Collected from public candidate posts and coding forums. Updated Nov 2026.