# Minimum Swaps To Make Strings Equal: Practice Notes
Minimum Swaps To Make Strings Equal shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Count xy and yx mismatches. Pairs of the same type cost 1, a leftover xy plus yx costs 2, and an odd total is impossible.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Not returning -1 when xy + yx is odd.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI help for online coding assessments.