I think it's wonderful that you took the time to go over the code. I'm much more happy to see that you explained both the recursive and iterative implementations of the functions. Thanks so much!
Wow. I just want to say thank you from the bottom of my heart. You are an amazing teacher. And you have no idea how much making these videos means to me. Thank you again
I really really like the way Tushar explains things, not giving out the code, but just the understanding one needs for the problem . Truly appreciate your effort @Tushar
Wow, I know more about deep software system analysis in a few minutes of listening to this man than all my time interacting with devs in almost 6 years.
Thank you very much @Tushar Roy for this tutorial. You really did a good job, explaining it clearly. I was able to do the coding challenge on HackerRank that is of difficulty level Hard very easily.
This video has helped me a lot in understanding Tries. The concepts were well-explained and I was able to come up with my own implementation on C++ fairly easily. Thanks!
Thanks for your useful labour here Tushar! I'd recommend getting a "lavalier" or just "lav" microphone; they're the ones that you clip onto your shirt's lapel. It would help the audio quality a _lot_, and make following the explanations a lot easier for international people who only know English as a second language. Lavalier mics are also relatively cheap compared to other kinds of microphone.
By far the best explanation for trie data structure. Thanks a ton for this video. What makes this video unique is the usage of sample strings to explain , which cover the corner cases.
SIr, it would be awesome and very helpful if you could teach this data structure in C/C++. because its implementation is quite confusing. Thank you sir for the video
+Tushar Roy - Coding Made Simple - I have a question at 12:55 Lets say, there is another word "cbc", which means that it will end at the node "c". Now we have two words '"abc" and " cbc". So when we delete the word "abc", we mark the node following "c" to false which would also delete "cbc". So how do we handle this scenario ?
"abc" starts with 'a' and "cbc" starts with c, so they will have different starting paths from the base root node. This situation will never occur. both will have an ending 'c' node, but these will be two different and independant nodes. Hope you understood! :)
I like your explanations very much. any doubt in algorithms I search for your videos. Do address more problems in dynamic programming, backtracking and graphs. They are tricky