Data Structures: Tries
Learn the basics of tries. This video is a part of HackerRank’s Cracking The Coding Interview Tutorial with Gayle Laakmann McDowell.
I never learned about tries in data structures. This is the first time I have heard of them and I already graduated.
wait how does she know about cricket I thought she was American
So this is for spell check. Bahh boring and not useful for games
a korean book in the background? hmm interesting!
A well articulated description in under five minutes to get me going with Trie data structures! Impressive!!
Another key phrase to keep in mind (asked during an interview a few years back): "Imagine that you’re implementing autocomplete for a video search engine…"
thank u maam for explaining importance i was skippingtries for my exam .
https://www.youtube.com/watch?v=AXjmTQ8LEoI is a more elaborate and easier to understand implementation.
For UI engineer, this is the one we could use for autocomplete in combox or predict typo.
‘Hi, I’m Gayle Laakmann McDowell, author of Cracking the Coding Interview’ was spoken as if she weren’t a demi-god of the highest caliber.
"why don’t you trie applying this to your own problems"
Nice video. I see a node’s children are stored in hashmap. But where is the character of that node is stored?
This bish detroyed the tech industry
If at first you don’t succeed, try trie again.. 😐
books in english, russian and korean about programming?
"Карьера программиста", кек
lol 0:30 what the hell did she say?????
This video should have been entitled “Data Structures: Tries in Java”.
The real question is… is a single instance of “tries” “try”, “trie”, or “tries”?
Crisp and Clear, Cheers!
why do interviewers ask this if we never went over it in school
Thanks Gayle Laakmann McDowell,
I have coded simple structure, merely following this tutorial.
Code is here: https://github.com/Madhu-Guddana/Trie-Data-Structure
Let me know your opinion and point of improvements.
What’s the software that can make the virtual blackboard?
finite state machine comes to mind
Huh, never heard of this before. I wonder if this would be handy for things like auto-complete mechanisms, or parsing partial commands and choosing the "closest" one, in an efficient way.
her words are very hard to follow in this video
gayle I love you. So much. That is all.
Korean as well as Russian this woman is a linguist and a programmer.👍
Could you please share implementation of tries.
What is this beautiful blackboard program?
Determining DNA Health is hard , right?
"The term trie was coined two years later by Edward Fredkin, who pronounces it /ˈtriː/ (as "tree"), after the middle syllable of retrieval" — Wikipedia
At 2:37 someone else noticed Chris Gayle (Cricket)
"This isn’t something CS students might have spent that much time in school, but it’s really really important for interview"
Translation: You’ll never use this in the real world but employers love to make impractical problems part of their interview process. Can’t have enough hoops to jump through, especially if it has nothing to do with the role you’re hiring for!
I love this blackboard, virtual board. Its real fun. If I would have had that same board while I was studying, what a fun it would have been
i trie to understand
too fast explanation
If already "call" is inserted, if we next insert "all" , will it create a new branch from root? or it returns "all" is already present
May I know the book list stacked at the back???
We definitely didn’t cover this in my college 0.0
4:45 why don’t you Trie applying this to a new problem…eh?
I’ve watched a lot of these videos but I just noticed the korean book at the top of that stack
Chia sẻ Khóa học Cấu trúc dữ liệu & giải thuật qua ví dụ kinh điển – C++ nền tảng, nâng cao, phỏng vấn xin việc https://blogofcntt.blogspot.com/2018/03/chia-se-khoa-hoc-cau-truc-du-lieu-giai.html
Chia sẻ khóa học Làm chủ Unity3D trong một ngày https://blogofcntt.blogspot.com/2018/03/chia-se-khoa-hoc-lam-chu-unity3d-trong.html
Share khóa học thiết kế Web bằng WordPress trị giá 4 triệu 9 miễn phí… https://blogofcntt.blogspot.com/2018/03/share-khoa-hoc-thiet-ke-web-bang.html
Khóa học Lập trình Java cơ bản Tiếng Việt. https://blogofcntt.blogspot.com/2018/03/khoa-hoc-lap-trinh-java-co-ban-tieng.html
Khóa học Lập trình Python từ Zero – Hero https://blogofcntt.blogspot.com/2018/03/khoa-hoc-lap-trinh-python-tu-zero-hero.html
why are people saying "Thank you so much these are life savers". She jumps from different topics and doesn’t even explain it. I have her voice speed toned down and still can’t understand the work.
Really wish I would’ve seen this before my interview…
Guys Im trying to implement a spellchecker program that loads a dictionary file with over 140k plus words with the longest word having 45 letters, correct me if I’m wrong if I use tries at most I would be using 46 * 26 = 116 bytes of memory right and this data structure would be more efficient compared to a hash table right… In C btw