Data Structures Bloom Filter: Better than Hash Map Bloom Filter is a probabilistic Data Structure that is used to determine whether an element is present in a given list of elements. It is quite fast in element searching.
Software Engineering Approaches for implementing Autocomplete Feature The various approaches for Text Auto-completion are Linear Search (Brute Force), Binary Search Approach, TRIE Data Structure, Ternary Search Tree Approach, Fuzzy Search, Burkhard Keller Tree Approach and Machine Learning Approach.
Data Structures Burkhard Keller Tree (BK Tree) Burkhard Keller Tree (BK-Tree) is a Tree Data Structure that is used to find the near-matches to a String Query. It is used in several applications like spell correction and autocompletion.
Data Structures Autocomplete Feature using Ternary Search Tree Autocomplete Feature can be implemented using Ternary Search Tree as well which is a memory optimized version of trie and performs equally well.
Algorithms Autocomplete feature using TRIE Data Structure Autocomplete is a feature of suggesting possible extensions to a partially written text and is widely used in search engine, code IDEs and much more. Trie data structure is a perfect fit to implement this feature efficient in terms of memory and time [O(length of string)].
Software Engineering New Features in Python 3.8 We have discussed several features of Python 3.8 such as Walrus Operators and pickling protocol which will allow programmers to get acquainted with these new features.
