50 Comments

  1. Alex Joslin on April 30, 2021 at 6:14 am

    I never learned about tries in data structures. This is the first time I have heard of them and I already graduated.



  2. PF 49 Prajjwal Singh on April 30, 2021 at 6:14 am

    wait how does she know about cricket I thought she was American



  3. Giancarlo Andre Bravo Abanto on April 30, 2021 at 6:15 am

    So this is for spell check. Bahh boring and not useful for games



  4. Aidan Zoldyk on April 30, 2021 at 6:20 am

    a korean book in the background? hmm interesting!



  5. Anindit Karmakar on April 30, 2021 at 6:20 am

    A well articulated description in under five minutes to get me going with Trie data structures! Impressive!!



  6. Dave Lively on April 30, 2021 at 6:22 am

    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…"



  7. vishal mishra on April 30, 2021 at 6:23 am

    thank u maam for explaining importance i was skippingtries for my exam .



  8. Saurabh Agrawal on April 30, 2021 at 6:24 am

    https://www.youtube.com/watch?v=AXjmTQ8LEoI is a more elaborate and easier to understand implementation.



  9. Paul Lan on April 30, 2021 at 6:29 am

    For UI engineer, this is the one we could use for autocomplete in combox or predict typo.



  10. Moises Acero on April 30, 2021 at 6:30 am

    ‘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.



  11. David La Roche on April 30, 2021 at 6:32 am

    "why don’t you trie applying this to your own problems"

    ha…



  12. Denis R. on April 30, 2021 at 6:34 am

    Great VIDEO!



  13. Santhosh Umapathy on April 30, 2021 at 6:37 am

    Nice video. I see a node’s children are stored in hashmap. But where is the character of that node is stored?



  14. Jojay on April 30, 2021 at 6:39 am

    This bish detroyed the tech industry



  15. Azam Shahani on April 30, 2021 at 6:39 am

    If at first you don’t succeed, try trie again.. 😐



  16. Nikolay Chernuha on April 30, 2021 at 6:39 am

    books in english, russian and korean about programming?



  17. Roman Gavrilovich on April 30, 2021 at 6:39 am

    "Карьера программиста", кек



  18. A U on April 30, 2021 at 6:41 am

    lol 0:30 what the hell did she say?????



  19. Rommel Mᴀʀᴛɪɴᴇᴢ on April 30, 2021 at 6:41 am

    This video should have been entitled “Data Structures: Tries in Java”.



  20. Pranav Polakam on April 30, 2021 at 6:42 am

    The real question is… is a single instance of “tries” “try”, “trie”, or “tries”?



  21. Sahil Rally on April 30, 2021 at 6:44 am

    Crisp and Clear, Cheers!



  22. kappa on April 30, 2021 at 6:47 am

    why do interviewers ask this if we never went over it in school



  23. Madhu Guddana on April 30, 2021 at 6:48 am

    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.



  24. Jason Zhang on April 30, 2021 at 6:49 am

    What’s the software that can make the virtual blackboard?



  25. Osman Kültür on April 30, 2021 at 6:49 am

    daymn 😀



  26. sirius707 on April 30, 2021 at 6:49 am

    finite state machine comes to mind



  27. haxpor on April 30, 2021 at 6:50 am

    Perfect explanation.



  28. Mythricia on April 30, 2021 at 6:53 am

    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.



  29. juan2thepaab on April 30, 2021 at 6:54 am

    her words are very hard to follow in this video



  30. GuruMack on April 30, 2021 at 6:55 am

    gayle I love you. So much. That is all.



  31. Jay Rathod on April 30, 2021 at 6:56 am

    Korean as well as Russian this woman is a linguist and a programmer.👍



  32. Mansi Garg on April 30, 2021 at 6:56 am

    Could you please share implementation of tries.



  33. Alex Majeska on April 30, 2021 at 6:56 am

    What is this beautiful blackboard program?



  34. Brumarul on April 30, 2021 at 6:56 am

    Determining DNA Health is hard , right?



  35. Cokeeeeman on April 30, 2021 at 6:56 am

    "The term trie was coined two years later by Edward Fredkin, who pronounces it /ˈtriː/ (as "tree"), after the middle syllable of retrieval" — Wikipedia



  36. Dharminder Singh on April 30, 2021 at 6:57 am

    excellent video



  37. Shivendra P. Singh on April 30, 2021 at 6:57 am

    At 2:37 someone else noticed Chris Gayle (Cricket)



  38. ExponentialAardvark on April 30, 2021 at 6:59 am

    "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!



  39. D T on April 30, 2021 at 7:00 am

    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



  40. Janac Meena on April 30, 2021 at 7:01 am

    i trie to understand



  41. Leōn on April 30, 2021 at 7:02 am

    too fast explanation



  42. Abdul majeed on April 30, 2021 at 7:07 am

    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



  43. 코리안 랩Korean Lab on April 30, 2021 at 7:08 am

    May I know the book list stacked at the back???



  44. TheLoyalpain on April 30, 2021 at 7:08 am

    We definitely didn’t cover this in my college 0.0



  45. Howard Wu on April 30, 2021 at 7:09 am

    4:45 why don’t you Trie applying this to a new problem…eh?



  46. Algos Explained on April 30, 2021 at 7:09 am

    I’ve watched a lot of these videos but I just noticed the korean book at the top of that stack



  47. Chính Nguyễn Văn on April 30, 2021 at 7:09 am

    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
    Xây dựng website với HTML, CSS và Javascript https://blogofcntt.blogspot.com/2018/03/xay-dung-website-voi-html-css-va.html
    Khóa học Javascript từ cơ bản đến nâng cao. https://blogofcntt.blogspot.com/2018/03/khoa-hoc-javascript-tu-co-ban-en-nang.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



  48. Faraz on April 30, 2021 at 7:09 am

    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.



  49. Btotts on April 30, 2021 at 7:11 am

    Really wish I would’ve seen this before my interview…



  50. Ojou NIi Sama on April 30, 2021 at 7:13 am

    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