# Minimum Number Of Swaps To Make The Binary String Alternating: Interview Notes

Minimum Number Of Swaps To Make The Binary String Alternating shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Make s alternate 0101... or 1010... with swaps of any two bits (equivalently: count mismatches). Try both target patterns; the cost is (mismatch count)/2 if the counts of 0 and 1 allow that pattern, else impossible (-1).

## 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

Only considering adjacent swaps (the problem allows any pair) or forgetting the pattern that starts with 1.

## 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 linkjob.ai.