# Suffix Tree Construction With Ukkonen: Interview Notes
Suffix Tree Construction With Ukkonen shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Build the tree online in phases; each phase inserts s[i] using active point, suffix links, and edge splits so work stays amortized linear.
## 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) time for a constant alphabet.
## Common mistake
Losing the active point after a split and restarting from the root every implicit extension.
## 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.ai.