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

When inserting, it doesn't matter where in the bucket you put it, so you can just insert it anywhere, thus insertion is O(1).

Lookup is O(n) because you will have to loop through each object and verify that it is the one you were looking for (as you've stated).