Hash Table Internals

Hash Table is an awesome data structure that powers the likes of Hash Sets and Hash Maps. Let's dive deep into it, understand the internals of it, and see what makes them so efficient on time and space.



1 Introduction to Hash Tables

1.1 Internal Structure of a Hash Table

2 Collision Resolution in Hash Tables

2.1 Chaining

2.2 Open Addressing

2.3 Linear Probing

2.4 Quadratic Probing

2.5 Double Hashing

3 Performance of a Hash Table

3.1 Understanding Performance

4 Resizing Hash Tables

4.1 Efficient Resizing

4.2 Implementing Resize

5 Implementing Data Structures

5.1 Implementing Hash Sets

5.2 Implementing Hash Maps

What you'll get

  • Structured Learning
  • In-depth Explanations
  • One-page write-up for each topic
  • Handwritten notes for each topic
  • Progress Tracking

About Instructor

Hey! I am Arpit Bhayani, a passionate CS engineer who loves to explore engineering in depth. In my last ~9 years of experience, I have worked at D. E. Shaw, Practo, Amazon, and Unacademy; and have built systems, services, and platforms that scaled to billions.

In 2018, I joined Unacademy as their first Technical Architect and there I designed, built, managed, and scaled services like Search, Notification, Logging, Deployment Engine, and many more. I am currently operating as a Director of Engineering leading the Site Reliability and Data Engineering verticals.