# Lyndon Factorization With Duval: Interview Notes

Lyndon Factorization With Duval shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Scan with three indices, extending while the prefix stays a Lyndon power, then emit equal-length factors.

## 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, O(1) extra space.

## Common mistake

Mishandling the case where s[k] < s[j] resets k incorrectly.

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