title: Collision resolution in Java HashMap
body: <p>Java <code>HashMap</code> uses <code>put</code> method to insert the K/V pair in <code>HashMap</code>. 
  Lets say I have used <code>put</code> method and now <code>HashMap&lt;Integer, Integer&gt;</code> has one entry with <code>key</code> as 10 and <code>value</code> as 17.</p>
  
  <p>If I insert 10,20 in this <code>HashMap</code> it simply replaces the the previous entry with this entry due to collision because of same key 10. </p>
  
  <p>If the key collides <code>HashMap</code> replaces the old K/V pair with the new K/V pair. </p>
  
  <p>So my question is when does the <code>HashMap</code> use Chaining collision resolution technique? </p>
  
  <p>Why it did not form a <code>linkedlist</code> with key as 10 and value as 17,20?</p>