# Minimum Number Of Swaps To Make The String Balanced: Walkthrough
Minimum Number Of Swaps To Make The String Balanced shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A balanced-parentheses string of '[' and ']'. Count the running balance; every time it would go negative you have an extra ']'. The number of swaps is ceil(max_unmatched_closes / 2), because each swap of a later '[' with an earlier ']' fixes two units of imbalance.
## 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
Running a full matching stack-simulation and counting every mismatch as one swap (overcounts).
## 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.