Data Structures: Hash Tables

[vighnesh]

People complaining that they don't understand what she is explaining, you guys need to first do your own research on what a hashtable is. This video is not supposed to teach you how to build one, but it explains what a hash table is and how it works behind the scene. And I am quite confident that she has done a very good job of explaining it. One tip of advice: Do your own research first before watching a tutorial on it. This way, you will be able to fill in the gaps that you had while researching.

[elliemay]

You jump from what is essentially key value pairs to hash codes so fast it doesn’t make any sense.

[olivierkoster]

this tutorial makes hash tables more complex than actually reading about it anywhere else..

[blyatman]

Great info, it would be great if you guys can structure all this info in playlist, like one for DS and another for algorithms, etc. This has over 300 k subs, I am sure a lot of people would benefit from that.

[trustme]

Wish you had included more of what you want us to look up ourselves in the video. Finding this video was my attempt to look deeper into it. Guess I have to find the missing info somewhere else, with no linked resources.

[mayurpatil]

Hashtable with hash function (hash queue header) and hash queue(buckets), this data structures is used in unix buffer cache. For those who want to explore this can check chapter 3 buffer cache from Design of UNIX system operating system by Maurice Bach.

[maddi]

From 3:56 – 4:07, the video says that in the Hashtable class we have an array that holds the data. It is described as “an array of the linked lists of the values”.

There is also an arrow that points to the LinkedList and says “linked list of Person objects”.

From my understanding, once we have converted our key to an index in the array, we store our key AND value in the linkedlist at that index. How can the linkedlist be of type Person if only the value is type Person, and the key is type String? For each linkedlist node, are we not meant to hold both the key and the value? Also, is holding multiple values in a single node even allowed?

[abcdeereijgfhd]

Dear McDowell, Thank you for your lecture on Hash tables. I did not get all the concepts when I read the book but this one really helped me to understand thoroughly. Great job!

[amitadhikaree]

This is best & simplest explanation of "how hashtable works" I've ever seen.

[MrRset]

0:25 this tip is usefull, My pc caught on fire and I use hash tables to fix it.

[sciencetechforyou]

Best possible person for explanation of this topic. Thanks for this video!

[RetroHoo]

I love all your other videos/explanations but this one left me a bit confused honestly... 😲

[VishwajeetPandeyGV]

This is best & simplest explanation of "how hashtable works" I've ever seen. Amazing Gayle! Thank you. I've bought your book too.

[martinmickels]

4:44 what does it mean to "fix that value"?

[maxodidily]

I still have quite a few years before I need to worry about interviews for a coding job but I'd just like to commend you on how well you explained this.

[BlackJar]

Another good way to resolve collision is the skip forward in the array -- if you keep the table from becoming overly full you will still find a spot for most things (natural or modified) in just a few jumps.

[spock]

A few times when it's easier to read a book than watch a video...

[Samwankins]

What a neat, organized explanation! Appreciate it.

[PamirTea]

Best playlist for job interviews ever.

[antoninguyen]

Thank you Gayle for giving me this valuable knowledge!