Status | Source | Problem Name | Difficulty | Tags | Solution |
---|
| YS | | Easy | | View Solution |
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
Status | Source | Problem Name | Difficulty | Tags | Solution |
---|
| YS | | Easy | | View Solution |
Quickly compute longest common prefix of two suffixes.
Status | Source | Problem Name | Difficulty | Tags | Solution |
---|
| Plat | | Hard | | External Sol |
| CF | | Hard | | Check CF |
Inverse Burrows-Wheeler
Resources |
---|
GFG | | could be simpler? |
CSES Guide?
Status | Source | Problem Name | Difficulty | Tags | Solution |
---|
| CSES | | Easy | | View Solution |
Run Enumerate
Resources |
---|
cp-algo | | could be simpler? |
(describe how to do easily w/ suffix array)
Status | Source | Problem Name | Difficulty | Tags | Solution |
---|
| YS | | Hard | | View Solution |