Worse case time complexity put/get HashMap

Question

What is the worst case time complexity of an Hashmap when the hashcode of it\'s keys are always equal.

In my understanding: As every key has the same hashcode it will al

Answer 1

HasMap Complexity

          Best.  Avg.   Worst
  Search  O(1)   O(1)   O(n)
  Insert  O(1)   O(1)   O(n)
  Delete  O(1)   O(1)   O(n)

Hope that will help in short