# Semidominator Path Compression: Explained
Semidominator Path Compression shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
During the Lengauer-Tarjan pass, compress ancestor paths so the minimum semidominator along a tree path is found in nearly constant time.
## 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
The simple implementation is O(m log n); linking-by-rank plus path compression is inverse-Ackermann.
## Common mistake
Compressing a path before the child's semidominator has been computed, which writes a stale ancestor label.
## 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 Linkjob.