Does the hashCode method guarantee uniqueness for each object?

The hashCode method in Java does not guarantee uniqueness for each object. It returns an integer value (hash code), which is used, for example, in hash tables for quick lookup. However, due to the limited range of int and the large number of possible objects, collisions can occur — different objects may have the same hash code.

It is important to adhere to the contract between equals and hashCode: if two objects are equal according to equals(), then their hashCode() should return the same value, but the reverse is not necessarily true.

Example of overriding:

@Override
public int hashCode() {
    return Objects.hash(field1, field2);
}