Suffix Automaton (SAM) Interactive Visualizer
A Suffix Automaton is the minimal deterministic finite automaton accepting all suffixes of a string, built online in linear O(n) time with at most 2n - 1 states to solve distinct substring, occurrence count, and LCS queries.
Study Suffix Automaton (SAM) Explanation · View Multi-Language Code · All Algorithms