explain internal working of hashmap?

Question

Accepted Answer

HashMap is a data structure that stores key-value pairs and uses hashing to provide constant time complexity for basic operations.

HashMap internally uses an array of linked lists called buckets to store the key-value pairs.
When a key-value pair is added, the hash code of the key is computed and used to determine the index of the bucket.
If multiple key-value pairs have the same hash code, they are stored as a linked list in the same bucket.
To retrieve a value, the hash code of the key is computed again to find the corresponding bucket, and then the linked list is traversed to find the exact key-value pair.
HashMap allows null keys and null values.
The initial capacity and load factor can be specified during HashMap creation to control its performance and memory usage.

Accepted Answer

explained.

Top Nuclei Java Developer interview questions & answers