# Union-Find With Rank And Path Compression: Interview Notes

Union-Find With Rank And Path Compression shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Attach the shorter tree under the taller and flatten paths on find.

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

Near O(alpha(n)) amortized per operation.

## Common mistake

Compressing paths but comparing ranks after the roots were already changed.

## 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 interview assistant.