Introduction
Few days back I wrote a post about the Trie data structure. This post is a continuation to it, and intends to introduce some practical problems which Trie solves. An autocomplete system is a perfect use case.
Many of the websites use this feature to help there users with suggestions & autocomplete. Also, in this post we will define a Trie interface and then work through this problem statement.
An autocomplete system using Trie
As we know from the previous text that a Trie is a tree like data structure which stores words such that the search for a word is proportional to ...

Read More