Suffix Tree & Suffix Automaton (SAM)
Compressed suffix tries and minimal state-equivalence DAGs with suffix links for O(m) substring queries.
This lesson has not been built yet.
Related problems 0
No related practice problems are linked yet.
Compressed suffix tries and minimal state-equivalence DAGs with suffix links for O(m) substring queries.
This lesson has not been built yet.
No related practice problems are linked yet.