Concepts3
🗂️Data StructureAdvanced
Aho-Corasick - DP Applications
Aho–Corasick (AC) turns a set of forbidden patterns into a finite automaton that lets you process or generate strings while tracking whether any pattern appears.
#aho-corasick#automaton dp#forbidden substrings+12
🗂️Data StructureAdvanced
Aho-Corasick Automaton
Aho–Corasick is a trie with failure links that finds all occurrences of many patterns in a single pass over the text.
#aho-corasick#multi-pattern matching#trie+12
🗂️Data StructureIntermediate
Trie (Prefix Tree)
A trie (prefix tree) stores strings or bit-sequences so that common prefixes share nodes, making operations depend on the key length L rather than the set size.
#trie#prefix tree#autocomplete+12