# Kasai LCP Linear Construction: Walkthrough
Kasai LCP Linear Construction shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Walk the suffix array in text order and use the fact that LCP[i] and LCP[rank[i+1]] differ by at most one, so each comparison starts from a saved height.
## 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) after the suffix array and rank array are known.
## Common mistake
Decrementing the height when moving to the next text position but then starting comparisons from zero, which silently becomes quadratic.
## 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 https://linkjob.ai.