What happens when there are too many collisions in a hash function?

The lookups/inserts/updates can become linear [O (N)] instead of constant time [O (1)] if the hash function has too many collisions. It doesn’t account for any empty slots which can be leveraged for more efficient storage and lookups. Ideally we require a good hash function to guarantee even distribution of the values.
For More Information Please Refer:

You May Also Like to Read: