Implement Trie (Prefix Tree) (LeetCode 208)
MediumLeetCode 208 · Trie Implementation · Google, Amazon +19 · 31:00Implement Trie (Prefix Tree) · Microsoft · Leetcode - 208My notes
Sign in to keep private notes on every station, with video timestamps.
Pause here and write your approach in two lines. Compare it with MIK's when the video ends.
Sign in to write your approach →About this video
Video solution for LeetCode 208 Implement Trie (Prefix Tree) by codestorywithMIK: Tries, Medium. Topics: Hash Table, String, Design, Trie. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- medium
- Topics
- Hash Table, String, Design, Trie
- Patterns
- Trie Implementation, Prefix Search & Autocomplete
- Chapter
- Tries
- Duration
- 31:00
Related problems
- Longest Common Suffix Queries (LeetCode 3093)
- Replace Words (LeetCode 648)
- Find the Length of the Longest Common Prefix (LeetCode 3043)
- Sum of Prefix Scores of Strings (LeetCode 2416)
- Count Prefix and Suffix Pairs I (LeetCode 3042)
- Counting Words With a Given Prefix (LeetCode 2185)
- Delete Duplicate Folders in System (LeetCode 1948)