Suffix Automaton
Everything on SkillVeris tagged Suffix Automaton — collected across the glossary, study notes, blog, and cheat sheets.
2 resources across 1 library
Interview Questions(2)
What is a Suffix Automaton?
A suffix automaton is the smallest deterministic finite automaton that accepts exactly every suffix of a given string, built online in O(n) time and space, and…
How Do You Solve the Longest Repeated Substring Problem?
The longest repeated substring problem asks for the longest substring that occurs at least twice, possibly overlapping, in a given string, and the standard eff…