# Karger Contraction Min-Cut Trials: Interview Notes
Karger Contraction Min-Cut Trials shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Contract random edges until two supernodes remain; repeat O(n^2 log n) trials so the global min-cut is found with high probability.
## 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 m log n) naive, faster with Karger-Stein.
## Common mistake
Running only a handful of trials and treating a miss as proof no smaller cut exists.
## 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 undetectable AI interview copilot.