Hash Tables: Chaining, Probing & Load Factor

Separate chaining vs open addressing, linear probing, tombstones, load factor, and rehash cost.

0 / 4 solved

Question Tags Difficulty Success

1. The Hole Hides Four

hash-tableslinear-probing +2

Medium 63%

2. Six Probes To Refuse

hash-tableslinear-probing +1

Medium 40%

3. Twelve Then Twenty Four

hash-tablesload-factor +1

Medium —

4. Rehashed With Old Modulus

hash-tablesrehashing +1

Medium —

Learning Resources

Open Data Structures, Hash Tables

CMU 15-122, Hash tables (separate chaining)

MIT 6.006 Lecture 4, Hashing

Java 21, HashMap capacity, load factor and rehashing

Up next

4 of 4 questions here are still unsolved.

Next module Hash Functions, Universal Hashing & Hash Flooding