# Stoer Wagner Global Min Cut: Practice Notes
Stoer Wagner Global Min Cut shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Repeatedly merge the last two vertices of a maximum adjacency search; the lightest cut-of-the-phase over all merges is a global min cut.
## 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 m + n^2 log n) with a heap, O(n^3) with arrays.
## Common mistake
Taking the lightest edge seen during the search rather than the cut that separates the last added vertex.
## 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.