# Ukkonen Online Suffix Tree: Interview Notes
Ukkonen Online Suffix Tree shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Process characters one by one, maintaining an active point and suffix links so every implicit suffix is extended in amortized 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
O(n) online for a constant alphabet (or O(n log sigma) with balanced edge maps).
## Common mistake
Creating a split node without setting its suffix link, which makes a later extension walk from the root and ruins the linear bound.
## 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 copilot.