Wavelet Trees & Succinct Text Machinery

Wavelet trees, suffix automata, palindromic trees, linear-time suffix arrays, and persistent segment trees.

0 / 8 solved
0/8 solved
Question Tags Difficulty Success
1. Wavelet Tree Cost
wavelet-treerange-kth-smallest +2
Hard —
2. At Most N Palindromes
eertreepalindromic-tree +2
Hard —
3. Linear Suffix Arrays
suffix-arraysa-is +2
Hard —
4. Persistent Kth Smallest
persistent-segment-treepath-copying +1
Hard —
5. Rank And Select
wavelet-treerank-select +2
Hard —
6. Two N Minus One
suffix-automatonsize-bounds +1
Hard —
7. The Minus One Root
eertreepalindromic-tree +1
Hard —
8. The Endpos Tree
suffix-automatonendpos +2
Insane —

Up next

8 of 8 questions here are still unsolved.