dsa2 min read
Suffix Array — O(n log n) Construction and Applications
Build a suffix array in O(n log²n) using doubling sort. Enables O(m log n) substring search, longest common substring, and number of distinct substrings.
Read →
Lcp
2 articles
dsa1 min read
Count Distinct Substrings — Suffix Array + LCP
Count the number of distinct substrings using the suffix array and LCP array. Total substrings minus sum of LCP values gives distinct count in O(n log n).
Read →