Hashing | Set 2 (Separate Chaining)
We strongly recommend referring below post as a prerequisite for this.
Hashing | Set 1 (Introduction)
What is Collision?
Since a hash function gets us a small number for a key which is a big integer or string, there is a possibility that two keys result in the same value. The situation where a newly inserted key maps to an already occupied slot in the hash table is called collision and must be handled using some collision handling technique.