dsa1 min read
Map Sum Pairs — Trie with Value Propagation
Implement insert(key, val) and sum(prefix) returning sum of values for all keys with given prefix. Trie with value at end node.
Read →
All Posts
1276 articles
dsa1 min read
Count Words Beginning with Prefix — Trie Count
Count words with given prefix. Simple trie with count at each node; reach prefix end and return count.
Read →
dsa1 min read
Maximum XOR With an Element — Offline Trie
For each query (xi, mi), find max xi XOR with element ≤ mi. Offline: sort queries and elements by value, add elements up to mi, query trie.
Read →
dsa1 min read
Find Length of Longest Common Prefix — Digit Trie
Find the longest common prefix length between any number in arr1 and any number in arr2. Build trie from arr1 digits, query with arr2.
Read →
dsa2 min read
Trie Applications Overview — XOR, Autocomplete, Suffix
Overview of trie application variants: binary trie for XOR, reverse trie for suffix matching, counted trie for scoring, and offline trie processing.
Read →
Page 115 of 256