Tries for Prefix Lookups
Store and query word prefixes fast.
Storing Words Smartly
A trie is a tree that stores words by sharing common prefixes. It makes prefix questions lightning fast. 🌳
Why Not Just a Set
A set answers full-word lookups, but tries also answer prefix queries like does any word start with pre.
All lessons in this course
- KMP Prefix Function
- Polynomial String Hashing
- Z-Function for Pattern Search
- Tries for Prefix Lookups