The Runtime Theory

topic / hash-tables

Hash Tables

Map keys to candidate locations and resolve collisions.

Explore hash functions, bucket selection, chaining, open addressing, load factor, resizing, equality, and expected lookup cost.

1 article · 1 video · 1 trace · 1 request flow · 1 interview · 5 total

Articles

hash tablesSep 25, 2026

Hash Tables: From Keys to Buckets

A hash table transforms a key into a hash value and uses part of that value to select a bucket or slot.

Request Flows

request flow · 5 stagesHow Hash Tables: From Keys to Buckets worksAn interactive concept flow for hash tables: from keys to buckets, from its assumptions through the main operation and boundary checks.

Videos

hash tablesSep 25, 2026

Video lesson: Hash Tables: From Keys to Buckets

Recording brief and narration plan for a visual lesson on hash tables: from keys to buckets.

Traces

trace 01 · runtimeTrace: Hash Tables: From Keys to BucketsFollow the key state changes and boundary checks involved in hash tables: from keys to buckets.

Interviews

medium · t2Explain Hash Tables: From Keys to BucketsExplain the model, execution steps, complexity, and limits of hash tables: from keys to buckets.

Explore adjacent

data structures

New lessons by email

Get new explanations about hash tables and related systems in your inbox.

One technical dispatch per week. No noise.