# Lyndon Word Duval Factorization: Walkthrough
Lyndon Word Duval Factorization shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Scan with a triple of pointers (i, j, k) and emit a Lyndon word whenever a mismatch proves the current candidate is complete.
## 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).
## Common mistake
Emitting a factor on equality instead of continuing, which splits a longer Lyndon word.
## 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.