# Gomory Hu Tree Equivalent Cuts: Explained
Gomory Hu Tree Equivalent Cuts shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A tree whose edges represent pairwise min-cuts: the min edge on the unique tree path equals the s-t min cut in the original graph.
## 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
n-1 max-flow computations.
## Common mistake
Contracting the wrong side of a cut, which assigns a pair an incorrect tree edge weight.
## 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 www.linkjob.ai.