Suffix Arrays

All suffixes of a string sorted, stored as starting indices — a compact alternative to suffix trees.

Expert

With the LCP array, solves substring search and repeated-substring problems; built in $O(n\log n)$ .

Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.

Discussion (0)