Algoteka

Suffix Automaton - All languages

Problem by oml1111

Problem description:

Construct a suffix automaton for some string, and then use it to find whether some other string exists as a substring in the first one.

Suffix automaton - wikipedia.org

Verified languages:

# Language Count
1 C++ 1

Unverified languages:

# Language Count
No unverified languages ...
View problem discussion (0 comments)