# Karger Stein Contracted Min Cut: Walkthrough

Karger Stein Contracted Min Cut 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; recursion on two contracted copies boosts the success probability of finding 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^2 log^2 n) expected for high probability.

## Common mistake

Contracting inside only one recursive copy, which loses the probability boost.

## 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 the Linkjob AI app.