# Suffix Array DC3 Skew Algorithm: Interview Notes

Suffix Array DC3 Skew Algorithm shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Recursively sort suffixes whose index mod 3 is 1 or 2, then radix-sort the 0-mod-3 suffixes against those ranks and merge.

## 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) for a constant alphabet.

## Common mistake

Merging the two groups with a string comparison instead of the already-computed ranks, which loses linearity.

## 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 undetectable AI interview copilot.