HashMap - how will it store objects where hashcode is same? How will it retrieve them?

Question

Sigiloso · Accepted Answer

Basically if there is a hashcode collision then HashMap would rely on equals method for further equality checks.

Sigiloso · Answer

In case of key hashcode collision, the bucket will be same but considering each bucket location of hashmap as a linked list, the key-value pair will be stored on the next node in the same bucket. At the time of retreival, it will use keys.equal to get the correct node.

Goldman Sachs

Pergunta de entrevista da empresa Goldman Sachs

Respostas da entrevista

Empresas seguidas

Buscas de vagas