title: Does hashtable allow duplicate values?
body: <p>Let's say I have a hash table arr[1..n], a set of keys k1,k2,k3(m no. of keys) etc.. and hash function h(k)</p>
  
  <p>h(k) takes input k and gives output i as an index to arr[i].</p>
  
  <p>Now in linear probing concept of hashing, let's consider the scenarios.</p>
  
  <pre><code>1&gt; let k1=101 and h(k)=i=5, then k1(101) is stored in arr[5]
  
  2&gt; let k2=102 and h(k)=i=6 then k1(102) is stored in arr[6]
  
  3&gt;Now again k3=101 and h(k)=i=5 then by linear probing it will go one
  step ahead(i=i+1) and check a[i](a[6]) is free or not, since a[6] is not free 
  so we repeat again (i=i+1) and check a[i](a[7]) is free or not, since a[7] is free
  so k3(101) is again inserted at arr[7].
  </code></pre>
  
  <p>Now arr[5] and arr[7] are possible duplicates, they belong to the same key.</p>
  
  <p>Does hashtable allow duplicates? Is my understanding correct.</p>
  
  <p>Please verify me if I am wrong</p>