Is it possible for two different values to have the same hash (collision)? How is this resolved?

Yes, hash collisions are possible because a hash function maps a potentially infinite set of input data to a limited set of fixed-length hash values.

How collision problems are addressed:

1. In hash tables:

   • Collision resolution methods are used, for example:
     • Chaining — all elements with the same hash are stored in a list.
     • Open addressing — searching for the next free cell.

2. In cryptography:

   • Cryptographically secure hash functions are used, which have a very low probability of collisions.
   • Additional measures are applied if necessary, such as using longer hashes or combining multiple functions.

3. In applications:

   • When generating unique identifiers (e.g., password hashes), a salt (random salt) is used to reduce the probability of collisions and increase security.

Thus, collisions are a natural part of working with hashes, and they are effectively handled at the algorithm and data structure levels.