# DC3 Skew Suffix Array Recursion: Study Guide
DC3 Skew Suffix Array Recursion shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Sort suffixes whose start index is not a multiple of 3 recursively, then radix-sort the remaining third and merge with the recursive ranks.
## 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
Comparing a multiple-of-3 suffix against a sample suffix with the wrong pair of ranks, which disorders the merge.
## 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 interview copilot app.