# Gale-Shapley Stable Matching: Practice Notes
Gale-Shapley Stable Matching shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Free proposers propose down their preference lists; a receiver keeps the best offer so far and rejects the rest until nobody is free.
## 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^2) proposals at most.
## Common mistake
Forgetting the result is proposer-optimal, not fair to both sides.
## 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.