# Cheeger Sweep Fiedler Cut: Explained

Cheeger Sweep Fiedler Cut shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Sort vertices by the Fiedler vector (second Laplacian eigenvector) and evaluate the conductance of each prefix; the best prefix approximates a sparse 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) after the eigenvector is known.

## Common mistake

Sweeping in adjacency-matrix eigenvector order instead of the Laplacian Fiedler vector, which is a different cut.

## 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 here.