Auto complete feature using trie

This video explains how the auto-complete feature is implemented using trie in the simplest way possible. Trie is a very data structure to store text data and retrieve in a very short time and so we make use of trie data structure for auto-completion of typed text, letter or phrase. This is a very commmonly asked interview question. CODE LINK is provided in the link below. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)

[pranshujain]

I am so unlucky that I discovered your channel so late, but your content is literally awesome, I am speechless. I always think that this topic is very tough and I never be able to do this with this playlist, I am completely confident that I can now teach trie any other also.

[sye]

great video, thanks for going through the time and space complexity as well!

[kunalsoni]

Best video 😊 to much informative..
Really very helpful to understand autocomplete feature😊

[kumarakash]

For 'abc' i think so that you have told wrong

[ellio]

I think in @5:52 the suggestion for 'abc' was supposed to be 'abb' because the query result should only show 1 suggestion. I believe it's a mistake, can you confirm this as well?

[poetryiscodingdecoding]

Maintain every word at end node and move curr pointer to the word and from there perform BFS

[kanwarkajla]

how to order the suggestions according to their frequency of search

[varunsadhu]

Why we use the preorder specifically, cant we use either dfs or bfs from the point where we simply find the prefix.

[tarunjainst]

What is the time and space complexity of suggesting word function

[HariKrishnan-ffhf]

To implement dictionary and input will be paragraph, from which program has to find misspelled word and provide near match in dictionary. How to implement this sir using data structure? Do you have this program?

[DeepakChoudhary-qrvp]

Implement a type ahead with a regex “*”. For e.g sample input queries could be suggest all words starting with “wa”, “st*t”, “ra*ct”

[vishaljoshi]

Dear Sir, can you explain about search string at any position and return all nodes path up to word end. I'm using this for address search. query like select empid, address from employee where address like '%suggestion

[rohithchittibommala]

Bro like cpp had stl what do we have in java please reply??

[ShreyaSingh-vrqi]

Should 26 also multiply in space complexity :- O ( no_of_words * max_word_length * 26) ??

[anjukumari-ibmd]

if any one has coded that in java please copy paste here? I'm facing issue

[satyanarayanagokavarapu]

@TECHDOSE Can you please explain this Guess the Word problem on leetcode and upload an video ?

[abhireddy]

sir please do kth smallest element in bst in o(h) time complexity i.e by using augmented tree concept other than inorder traversal
sir please.

[TopToBottom]

Wth is this rename it to trie 101 not autocomplete