Rare
0/6
Suffix Array
Author: Benjamin Qi
Prerequisites
Quickly Sorting Suffixes of a String (and Applications)
Focus Problem – read through this problem before continuing!
Resources
| Resources | |||
|---|---|---|---|
| CF | Videos & Practice Problems | ||
| cp-algo | |||
| CPC | |||
| CP2 | |||
Implementations
| Resources | |||
|---|---|---|---|
| Benq | O(N log N) | ||
(recommend that you also test against brute force for many small strings)
LCP Array
Quickly compute longest common prefix of two suffixes.
| Status | Source | Problem Name | Difficulty | Tags | Solution | URL |
|---|---|---|---|---|---|---|
| Plat | Hard | External Sol | ||||
| CF | Hard | Check CF |
Burrows-Wheeler Transform
| Resources | |||
|---|---|---|---|
| GFG | could be simpler? | ||
Run Enumerate
| Resources | |||
|---|---|---|---|
| cp-algo | could be simpler? | ||
(describe how to do easily w/ suffix array)
Module Progress:
Join the USACO Forum!
Stuck on a problem, or don't understand a module? Join the USACO Forum and get help from other competitive programmers!