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 →
All Posts
1276 articles
dsa1 min read
Maximum XOR of Two Numbers — Binary Trie
Find maximum XOR of any two numbers in array. Binary trie (bit by bit from MSB): for each number greedily choose opposite bit to maximize XOR.
Read →
dsa1 min read
Search Suggestions System — Trie with Sorted Lists
After each character typed, return up to 3 lexicographically smallest matching products. Sort products, insert into trie, store sorted lists at each node.
Read →
dsa1 min read
Longest Word in Dictionary — Trie BFS/DFS
Find longest word where all prefixes exist in dictionary. Trie: only follow nodes where is_end=True, track max depth.
Read →
dsa1 min read
Palindrome Pairs — Trie + Palindrome Check
Find pairs (i,j) where words[i]+words[j] is a palindrome. Insert reversed words into trie, for each word check palindromic suffix/prefix conditions.
Read →
Page 113 of 256