I have moved this over to the Tech Interview Cheat Sheet Repo and has been expanded and even has code challenges you can run and practice against!
\
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This module contains operations for working with radix trees. A radix tree | |
is a data structure for efficient storage and lookup of values that often | |
share prefixes, typically used with strings. | |
A common question when I show this to people is: how do I add to the tree? | |
delete? update? For these, grab the Range of the tree, use set logic to | |
add/remove any elements, and construct a new tree with RadixTree. | |
For educational purposes, I've heavily commented all the operations. I | |
recommend using the constant expression evaluator to try the building blocks |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This playbook has been removed as it is now very outdated. |