How are hash collisions handled?

Question

I\'ve recently learned a little bit about hash values, and therefore also heard of about the problem of hash collisions.
I therefore wondered: How does one deal with tho

Answer 1

There are two basic techniques:

1. Rehash using a different prime, typically N- 2 where N is the original prime, chosen such that both N and N-2 are prime.
2. Use a list per hash.

Or both.