What does the concept of a collision mean in the context of hashing?

Question

Accepted Answer

When given two distinct keys x 1 ​  and  x 2 , the hash value is identical, i.e.  ℎ ( x 1 ) = ℎ ( x 2 )

Answer

When given two distinct keys x 1 ​  and  x 2 , the hash value is different, i.e.  ℎ ( x 1 ) ≠ ℎ ( x 2 )

Answer

When the slot at the hashed position is already taken by another key

Answer

When we have to run a conflict resolution mechanism

Crowdly