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 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.
