I never knew such data structure exist. I implemented auto complete feature for my hobby site using dictionary 😅. Anyways good video, keep up the great work. Let's Go😂
Some important points missed in the demo: [1] w[i] - 'a' >> yields a byte data type .. assuming that this is pure ASCII characters i.e. can be represented in only 1 byte only. [2] subtracting 'a' implies that there is no capital letters in w as well. Although there is no ToLower() called on w.
It should be noted that it's actually supposed to be pronounced like "tree" as its root comes from the word retrieval. Otherwise excellent explanation of how a trie works.
![FORTNITE CLASSICS IS BACK! Fortnite Item Shop [November 15th, 2024] (Fortnite Chapter 5)](http://i.ytimg.com/vi/RbQURbeFwqs/mqdefault.jpg)
Great explanation and demo
I really like these videos. Its really well produced and very clear. Thank you!
Wow! That's amazing! I'd love to see how it could be implemented for an autocomplete feature. Tried it myself but couldn't find a way.
I never knew such data structure exist. I implemented auto complete feature for my hobby site using dictionary 😅. Anyways good video, keep up the great work. Let's Go😂
Some important points missed in the demo:
[1] w[i] - 'a' >> yields a byte data type .. assuming that this is pure ASCII characters i.e. can be represented in only 1 byte only.
[2] subtracting 'a' implies that there is no capital letters in w as well. Although there is no ToLower() called on w.
It should be noted that it's actually supposed to be pronounced like "tree" as its root comes from the word retrieval. Otherwise excellent explanation of how a trie works.
Hola