dsa5 min read
Tries (Prefix Trees) — Complete Guide
Master Tries: insert/search/prefix, word search II, autocomplete, XOR trie for max XOR, and bitwise trie patterns with 5-language implementations.
Read →
All Posts
1575 articles
dsa2 min read
Implement Trie (Prefix Tree) — Insert/Search/StartsWith
Implement a Trie with insert, search, and startsWith operations. Core data structure for all prefix-based problems.
Read →
dsa1 min read
Design Add and Search Words — Trie with Wildcard DFS
Trie that supports wildcard '.' matching any character. DFS through trie when '.' encountered, trying all children.
Read →
dsa2 min read
Word Search II — Trie + Grid DFS Pruning
Find all words from a list in a grid. Build trie from words, DFS on grid while traversing trie simultaneously to prune early.
Read →
dsa1 min read
Replace Words — Trie Shortest Prefix Replacement
Replace each word in sentence with its shortest root from dictionary. Insert roots into trie; for each sentence word find shortest matching prefix.
Read →
Page 172 of 315