What is Hash Collision in Java ?

In a Hashing scenario, at times two different objects may have same HashCode but they may not be equal. Therefore, Java will face issue while storing the two different objects with same HashCode in a HashMap. This kind of situation is Hash Collision.

There are different techniques of resolving or avoiding Hash Collision. But in HashMap, Java simply replaces the Object at old Key with new Object in case of Hash Collision.



You May Interest

Enumeration and Iterator, Which One Has Better Performance in Jav ...

Comparing HashSet and TreeSet Collections in Java

What is a Filter in JSP ?

How Can We Improve the Performance of IdentityHashMap in Java ?

Which Class Contains Clone Method in Java ?