Data Structures in Golang - Hash Tables

Hello, this is a video for the data structures and algorithms series in Golang, where I talk about hash tables and other related topics like collision handling, hash functions and some main operations.
If you wish to solve problems in leetcode or hackerrank, it would be good to know about heaps.

If you wish to support me 🤗 :

Today’s topic is very important, not only because it’s one of the most basic data structures, but also, it is commonly asked in #Coding Interviews.
coding interviews can also ask you to implement a hash set or a hash map without using any built in libraries. You can see these kind of problems on #Leetcode or Hackerrank, which would be something you'll know about if you want to work in software engineering or computer science.
so if you are preparing for these kind of interviews, you really need to understand how hash tables work.
In this video, we will talk about things like how hash tables work, and about hash functions, collisions etc.,
and after knowing how hash tables work, you will be able to understand why hash tables are so fast for searching keys.
Like always, I will first explain the basic concepts with diagrams and animations, and then we will code hash tables in Go.
We will also learn how to debug in vscode, while we are programming hash tables in #Golang.

00:00 Introduction
00:58 Hash Table
02:31 Hash Functions
03:35 Collision handling (separate chaining & open addressing)
06:09 Insert, Delete and Searching in a hash table
08:07 Time complexity of a hash table

10:24 Programming example of hash table - outline
10:54 Hash table and bucket structures
13:21 Initiating a hash table and defining a hash function
19:02 Inserting a key in a linked list
21:12 Searching a key in a linked list
24:41 Deleting a key in a linked list
28:46 Using breakpoints in VSCode

[barnabassolomon]

dont know why you stopped making these tutorials
it's the best one i've ever seen and love the extra effort you give to explain it with animations/drawings
i hope you continue these series because its very very very very very very fantastic

thank you for your content

[ykzghtvo]

It is a great tutorial! Thank you very much! Now I understand hashtables!!!

[ricardomora]

Keep going Jamie!! You are doing a great job

[nicholasbalby]

Please, keep going. Your content is great.

[SaiyanJin]

I'm glad I found this channel!! So far the best explanations for me!

[cashcowislive]

I just keep coming back to your channel when ever I am switching my job, You have an excellent teaching style. I think you should keep much creating such content as it is really interesting.
Also, I have an idea for your next video if you can come up with simple implementation of LRU cache it'll help me and youtube community also.
Thanks much!!

[abdurrehmanazeem]

Coming back to your channel for data structure videos and all i can think of is WOW these videos are so well made.

[anujdatar]

Great video. What do you use to make those animations? I teach manufacturing engineering at university, and would love to use something like this instead of clunky PowerPoint animations.

[KyleHarrington]

i will forever visualize South Park characters when i think of hash tables, and i'm so happy about that lol

[nqmhucf]

much thanks, very helpful! please come back to youtube

[CloudLine-Yazn]

Very professional explanation, keep going !

[mo]

Great video! Thanks for creating this!! I'm just confused about one thing....doesn't a hash map hold key:value pairs? Meaning, each key should have an associated value? This seems more like a "set" data structure, but allows non-distinct entries..?

Am I missing something?