Collision resolution in Java HashMap

Question

Java HashMap uses put method to insert the K/V pair in HashMap. Lets say I have used put method and now HashMap<

Answer 1

There is no collision in your example. You use the same key, so the old value gets replaced with the new one. Now, if you used two keys that map to the same hash code, then you'd have a collision. But even in that case, HashMap would replace your value! If you want the values to be chained in case of a collision, you have to do it yourself, e.g. by using a list as a value.