A hash table stores key–value pairs for near-constant-time lookups using a hash function that maps keys to array indices. These tutorials cover how hashing works, how collisions are handled, and where hash tables are used in real systems.
What you’ll learn in Hashing and Hash Tables
- How hash functions map keys to buckets and what makes a good hash function
- Collision resolution: separate chaining vs. open addressing (linear/quadratic probing)
- Load factor, resizing, and amortized performance analysis
- Practical uses: caches, symbol tables, sets, and de-duplication
Related tutorials & topics
Explore every tutorial and course in the Content Directory, or read more on the Genius Blog.