Hash tables, collision strategies, and probabilistic filters — visualized bucket by bucket.
4 visualizations
Resolves hash collisions by storing colliding keys in a per-bucket linked list.
Resolves collisions by scanning forward one slot at a time until a free cell is found — simple and cache-friendly, but prone to clustering.
Resolves collisions with quadratically growing jumps (+1, +4, +9, …), breaking up the contiguous runs that plague linear probing.
Uses a second hash function as the step size, so different keys sharing a home slot follow completely different probe paths — no clustering.