# Cytron Dominance Frontier SSA: Interview Notes

Cytron Dominance Frontier SSA shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Place phi functions at the iterated dominance frontier of each assignment, then rename variables by walking the dominator tree.

## 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) phi placements on reducible CFGs in practice; the frontier sets are linear for well-structured code.

## Common mistake

Inserting a phi in every successor of a block rather than only at the dominance frontier, which creates far too many phis.

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