Implement Trie (Prefix Tree) || C++/Java/Python || Microsoft Interview Question

In this video, I'll talk about how to solve the problem - 208. Implement Trie (Prefix Tree) - In which we understand the meaning of this trie data structure and what is the logic and intuition behind implementing this, how this is logically understood and then codes in all 3 languages(C++/Java/Python)

Let's Connect:

Resources you can try:

🎥Channel Playlists

About Channel:
We teach about how you can grow in life & educate about programming in Fun way.

About Me:
I am Aryan Mittal - a Software Engineer, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)

✨ Timelines✨
0:00 - Why we need Trie?
3:23 - Trie Insert Intuition & Logic
9:29 - Trie Search Intuition & Logic
11:24 - Trie Starts With Intuition & Logic
13:01 - Time & Space Complexity
15:08 - Code Explanation

✨ Hashtags ✨
#skills #college #studentslife #students #teenager #life #teenagers #students
#programming #Interviews #leetcode #faang

[Nothing-egol]

hi, i got to know about your channel from leetcode discuss section your content and teaching methodalogy is awesome can you please make videos on dp on grid dp on tree and other popular graph and binary serach questions which frequently asked in Online assesment because i intern test i had appeared all big companies but couldnt able to solve questions because they were not standard dsa questions or dsa concepts questions they are cp type questions so can you make a series for ONline Assesment it would be great help Thank you

[piyushparadkar]

bhai kuch pattern types pe b bna do video jese segment tree, sliding window, trie kuch question same pattern follow krte hai vese ki koi playlist . you explain things very well ...

[lostcyrus]

Great explanation brother was not knowing anything about tha trie but still you made me understand a lot. Keep going bro.

[blazedoodle]

killed it !!! precise and damn good lecture

[nehilnama]

i have a doubt, in the left tree u marked p as complete string but it still have nodes further L and E. but in right tree u did not marked p as complete coz it have E as a node after it, can u please explain??