Collisions in Hash Tables
Learn how collisions occur in hashing and the common strategies used in resolving these collisions.
We'll cover the following...
When you map large keys into a small range of numbers from 0-N, where N is the size of the array, there is a huge possibility that two different keys may return the same index. This phenomenon is called a collision.
Strategies to handle collisions
There are several ways to work around collisions in the array. The three most common strategies are:
- Linear probing
- Chaining