title: java HashMap collision
body: <p>I was reading about how hashmap works. I was reading through the 
  <strong><a href="http://javarevisited.blogspot.in/2011/02/how-hashmap-works-in-java.html">"What will happen if two different objects have same hashcode"</a></strong>. </p>
  
  <p>According to it if two objects has same hashcode both will be stored in <code>LinkedList</code> but as far as I know if two hashcode then previous one will get overridden with new one(correct me if I am wrong).</p>
  
  <p>Can someone please put more light on how hashmap use object as key internally and what will happen if two objects has same hashcode and how both objects will be fetched with <code>get()</code>?</p>