hash-table

1 free lesson tagged hash-table across Computer Science. Each one is a short sequence of focused steps with narration and a five-question quiz at the end — take them in any order, no signup required.

Computer Science

intermediate

Hash Tables: Collisions, Load Factor, and Swiss Tables

A hash table promises constant-time lookup, and the promise holds only because of how it handles collisions. This lesson builds one from the array up: hashing, chaining versus open addressing, why load factor is the tuning dial, and how modern tables scan sixteen slots at once.

10 steps·~15 min

Hash Tables: Collisions, Load Factor, and Swiss Tables

Related topics