CodingHard
Minimum swaps to make two strings equal
Filed under Wize Commerce
The question
Given two strings containing characters of the same superset, find the minimum number of swaps to make the two strings equal using operations like swapping adjacent characters or swapping the first and last characters on either string.
No write-up yet. Related questions below have one.
Related Wize Commerce questions
Collected from public candidate posts and coding forums. Updated Nov 2026.