Collisions in Hash Tables

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
• Resizing the array

1. Linear probing

This strategy suggests that if your hash function returns an index that is already filled, ...