Hash Tables Internals — ELI5

Imagine you have a giant filing cabinet with 1,000 drawers, and you need to store files for different people. You could put them in order — Alice in drawer 1, Bob in drawer 2 — but then finding “Zara” means checking every drawer.

A hash table uses a smarter trick. It runs each person’s name through a special formula (called a hash function) that converts the name into a drawer number. “Alice” might become drawer 437. “Bob” might become drawer 112. Now, when you need Alice’s file, you run her name through the formula again, get 437, and go straight there. No searching.

This is exactly how Python’s dictionaries work:

contacts = {"Alice": "555-1234", "Bob": "555-5678"}
print(contacts["Alice"])  # Goes straight to the right spot

The lookup is almost instant, no matter how many items you have. A dictionary with 10 items and a dictionary with 10 million items take roughly the same time to find one entry.

What happens if two names land on the same drawer? That is called a collision. Python handles it by looking at the next available spot. The hash function is designed to spread things out evenly, so collisions are rare.

The trade-off is memory. Hash tables use more space than a simple list because they need extra empty drawers to keep things spread out. But the speed gain is massive.

One thing to remember: Every time you use a dictionary or a set in Python, you are using a hash table. It is the secret behind their speed.