// TOPIC
#hashing
4 articles
◆Beginner
01Hashing: The O(1) Superpower
How hash functions and buckets turn lookup into O(1) average time — the intuition behind collisions, chaining, and load factor that every engineer should own.
#hashing#hash-tables#fundamentals
11 min◆BeginnerAmazonGoogle
02Hash Sets
A hash set is a hash table with the values ripped out — pure O(1) membership, dedup, and "have I seen this?" tracking. Master it and a whole class of O(n²) problems collapse to O(n).
#hash-sets#data-structures#hashing
12 min◆◆◆AdvancedGoogleAmazon
03Bloom Filters
How a bloom filter answers 'definitely not' or 'maybe yes' in ~10 bits per item: the math behind 1% fpp, working Python code, and production uses.
#bloom-filters#probabilistic-data-structures#hashing
13 min◆◆IntermediateGoogleAmazon
04Hash Tables
The interview MVP. How hash functions turn arbitrary keys into O(1) lookups, what actually happens during a collision, and why "just use a hash map" is usually the right instinct.
#hash-tables#data-structures#hashing
10 min