Terminus

Algorithms and data structures

Hash tables

Constant-time lookup on average, why it works, and when it doesn't.

About 8 hours of study.

Where to learn it

Read
Open Data Structures

Pat Morin

Chapter 5

Watch
Introduction to Algorithms (MIT 6.006, Spring 2020)

Erik Demaine, Jason Ku, Justin Solomon

Lecture 4, Hashing

Practise
Top Interview 150

LeetCode

Top Interview 150: Hashmap

Grouped by topic, which makes it a good map of interview DSA. Needs a free account.

Wrong chapter, dead link, or know something better? Tell us on GitHub.

Which roles ask for it

Before and after