Strings
String costs, KMP and Z, rolling hashes, tries, and suffix structures.
0 / 15 solved
-
String Representation & Cost Models
Mutable vs immutable strings, concatenation in loops, substring copies vs views, encodings, and comparison cost.
-
Pattern Matching: KMP & Z
The prefix function, KMP failure links, the Z-array, and periods and borders.
-
Rolling Hash & Rabin-Karp
Polynomial and prefix hashes, choosing the base and modulus, collision odds, anti-hash tests, and double hashing.
-
Tries & Prefix Structures
Tries, node cost vs alphabet size, prefix counts and autocomplete, compressed tries, and binary tries for max XOR.
-
Suffix Arrays, Automata & Aho-Corasick
Suffix arrays and LCP, suffix automata, Aho-Corasick, and Manacher.
Up next
15 of 15 questions here are still unsolved.