Trie (Prefix Tree) Study Guide
==============================

:::warning
[< Return to Home Page](https://hackmd.io/@siansiansu/HknJJm0W0)
:::

Basic Trie Operations
---------------------

Fundamental problems that introduce the concept and basic usage of Tries.

- 🟨 [208\. Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/) \[[Solution](https://hackmd.io/@siansiansu/B1-Pcd5fC)\]
- 🟨 [211\. Design Add and Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure/)

Advanced Trie Applications
--------------------------

Problems that demonstrate more complex uses of Tries in string processing and manipulation.

- 🟨 [139\. Word Break](https://leetcode.com/problems/word-break/) \[[Solution](https://hackmd.io/@siansiansu/H1bxSUCQ0)\]
- 🟨 [648\. Replace Words](https://leetcode.com/problems/replace-words/) \[[Solution](https://hackmd.io/@siansiansu/SJERh9lH0)\]

System Design with Tries
------------------------

Problems that involve using Tries in larger system designs or more complex data structures.

- 🟥 [588\. Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system/)

Problem Difficulty Legend
-------------------------

- 🟩 Easy
- 🟨 Medium
- 🟧 Medium-Hard
- 🟥 Hard
- ⬛ Very Hard

Additional Resources
--------------------

- [Trie Data Structure (Video)](https://www.youtube.com/watch?v=AXjmTQ8LEoI)
- [Implementing a Trie in Python](https://albertauyeung.github.io/2020/06/15/python-trie.html/)
- [Trie Applications and Use Cases](https://www.geeksforgeeks.org/advantages-trie-data-structure/)