CareerCup

whenever a collision occurs, create a linked list with all those elements for that key. then the complexity becomes O(L), where L is the number of elements in the linked list instead of O(1).

open addressing or probing (linear for example). check the intro to algorithms book.

Do a second hashing.
Linear probe is a simple hashing function.

Either go Open addressing or Separate chaining.
Open Add: Linear, Quadratic probing or double hashing.

Linear/Quadratic with the same clustering problem in near future.
Double hashing, proffered over Linear/Quadratic.

But if you will see, in the java api, they made use of Separate chaining for implementing maps.

Please correct me, if anything wrong/missing.

Thanks..