Tries
Prefix tree that makes autocomplete, dictionary and XOR maximisation problems linear.
Newinterview weight 459 problems1 visualisers
18
mastery
Attempts logged
0
Predicted success on the next one
33%
Solved here
0 / 9
What you actually need to hold in your head
- Each node is one character edge
- Search cost depends on word length, not dictionary size
- A bitwise trie solves the max XOR pair
- Store counts to support deletion
Comfortable with these first
Next in the path
Math & Number Theory
Watch it run
Step through the algorithm before you write it.
Patterns in this topic
The trigger phrases are what you are training yourself to notice.
Tries problems
Ordered by sheet phase, so the early ones are the highest signal.
0 / 9 solved