Collisions are unavoidable, so every hash table needs a strategy: chaining keeps a list per slot, open addressing looks for another slot.
Hash collision
Two different keys that map to the same slot of a hash table.
Collisions are unavoidable, so every hash table needs a strategy: chaining keeps a list per slot, open addressing looks for another slot.