Implement Trie (Prefix Tree) - Tries - Leetcode 208 (Python) - Blind 75

In this video, we're taking a look at Leetcode 208 Implement Trie. I'm going to break down how a trie (prefix tree) works.

Tries are niche data structures that share some similarities with Trees. While they're not that common in coding interviews they are asked occasionally. Should you ever be asked to implement a Trie in real life then this video has you covered!

Also, apologies for the cropped video, this is an older one from years ago 😅. But hopefully, it isn't too much of a bother, I still think the video is packed with useful information.