# Lengauer Tarjan Semidominator: Walkthrough

Lengauer Tarjan Semidominator shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Compute semidominators with a DFS spanning tree and path compression, then derive immediate dominators from the semidominator forest.

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

Almost O(m) with path compression and linking by size; O(m log n) in the simpler variant.

## Common mistake

Forgetting to apply the explicit-dominator correction after the semidominator pass, which assigns the wrong idom to some vertices.

## 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 real-time AI interview assistant for live interviews.