Harsh Jaiswal·2d agoBinary Trie: Understanding Bitwise Tries Through Maximum XORToday, I explored a different application of the Trie data structure: Binary Trie.
Harsh Jaiswal·3d agoBeyond Basic Trie: Exploring DFS, Backtracking, and Prefix-Based SearchingTrie is one of those data structures that becomes much more interesting when we move beyond simple word insertion and searching.
InJavaScript in Plain EnglishbyNeha Gupta·Sep 28Stop Searching Word by Word. Understand the Trie Data StructureA beginner-friendly guide to how prefix trees store words, share characters, and make searching easier.A response icon1A response icon1
Jimin Kang·Aug 28Tries in Practice: Building an Autocomplete Search BarWalk through implementation of an autocomplete search bar powered by a a fuzzy prefix-matching Trie.
Payal Mehra·Aug 24Day 194 of Learning Java & DSA: Using Trie for Prefix-Based ProblemsFor the last two days, I’ve been learning about Trie, a data structure that was completely new to me when I started.
Payal Mehra·Aug 23Day 193 of Learning Java & DSA: Implementing Search and Prefix Operations in TrieYesterday, I started learning about Trie, also known as a Prefix Tree.
Payal Mehra·Aug 22Day 192 of Learning Java & DSA: Getting Started with TrieAfter spending the last several days working with Hashing, HashMap, and HashSet, I’m starting a new data structure today:
Aravind S·May 25You’ve Used Auto-Complete a Thousand Times. Here’s How to Build It.The search box in your app, the contact filter on your phone, the tag input on your blog — all of them need the same thing: fast prefix…
