# Sort Colors: Practice Notes

Sort Colors shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Dutch national flag: keep a low pointer for 0s, a high pointer for 2s, and scan mid. Swap 0s left and 2s right, and only advance mid on a 1.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (two pointers, a sliding window, prefix sums, a monotonic stack, or binary search on the answer) and why a linear nested scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Counting then rewriting, which is two passes and hides the in-place invariant.

## 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 https://www.linkjob.ai/.