Implement Trie (Prefix Tree) - Leetcode 208 - Trees (Python)

[@GregHogg]

Master Data Structures & Algorithms For FREE at AlgoMap.io!

[@mr.sheldor794]

As someone who is a beginner in coding this was very helpful to watch. I didn't understand some of it, but the overall idea made sense. Good video

[@GregHogg]

Yeah this one is a bit confusing with the nested dictionaries... Glad you enjoyed it!

[@christianjt7018]

Wow! This is the first time that I see that trick with dictionaries. You are awesome, thanks for sharing.

[@saurabhbhagat4528]

Wow, I solved it exactly like your solution with nested 'Objects' in javascript

[@wennwenn1422]

@3:18, I think in static typed languages (C#/Java), TreeNode object implementation is much easier? would you agree?

[@GregHogg]

@@wennwenn1422 You could still use maps but yeah probably

[@saleheen1]

Very clever

[@GarouNguyen]

bro what is d = d[c] i print that with sublime text but still don't understand

[@roboeagle4930]

so the dictionary is getting more nested right? So what d = d[c] means is go into the next level of the dictionary for example say d = {'h':{'i':{'.':'.'}}} and you find d[c] where c = 'h'. The value of that is {'i':{'.':'.'}}, so if we set d = d[c] we move into the dictionary so our new d = {'i':{'.':'.'}}

[@charansaimathkala1096]

Hi , can you do a video on dynamic programming how to solve those problems efficiently, as I am a beginner can you explain it in detail

[@GregHogg]

Done, please watch my video called Fibonacci number

[@charansaimathkala1096]

@@GregHogg TQ so much