algorithm/tech-interview-handbook
1
0
Fork 0
mirror of https://github.com/yangshun/tech-interview-handbook.git synced 2025-08-02 19:46:40 +08:00
Code Issues Packages Projects Releases Wiki Activity

contents: rearrange algo layout structure

Browse Source
This commit is contained in:
Yangshun
2022-04-06 09:47:25 +08:00
parent 0acd6749ca
commit 73dd64f96d
16 changed files with 151 additions and 147 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
contents/algorithms/trie.md
View File

@ -10,6 +10,14 @@ Tries are special trees (prefix trees) that make searching and storing strings m
Be familiar with implementing from scratch, a `Trie` class and its `add`, `remove` and `search` methods.
## Learning resources
- Readings
- [Trying to Understand Tries](https://medium.com/basecs/trying-to-understand-tries-3ec6bede0014), basecs
- [Implement Trie (Prefix Tree)](https://leetcode.com/articles/implement-trie-prefix-tree/), LeetCode
- Additional (only if you have time)
- [Compressing Radix Trees Without (Too Many) Tears](https://medium.com/basecs/compressing-radix-trees-without-too-many-tears-a2e658adb9a0), basecs
## Time complexity
`m` is the length of the string used in the operation.
@ -20,14 +28,6 @@ Be familiar with implementing from scratch, a `Trie` class and its `add`, `remov
| Insert | O(m) | |
| Remove | O(m) | |
## Learning resources
- Readings
- [Trying to Understand Tries](https://medium.com/basecs/trying-to-understand-tries-3ec6bede0014), basecs
- [Implement Trie (Prefix Tree)](https://leetcode.com/articles/implement-trie-prefix-tree/), LeetCode
- Additional (only if you have time)
- [Compressing Radix Trees Without (Too Many) Tears](https://medium.com/basecs/compressing-radix-trees-without-too-many-tears-a2e658adb9a0), basecs
## Corner cases
- Searching for a string in an empty trie