how hashset and hashmap work internally?

Question

Accepted Answer

HashSet and HashMap are both data structures in Java that use hashing to store and retrieve elements.

HashSet uses HashMap internally to store its elements as keys with a dummy value.
HashMap uses an array of linked lists called buckets to store key-value pairs.
Both HashSet and HashMap use the hashCode() method to calculate the hash value of keys.
HashSet uses the hash value to determine the bucket where an element should be stored.
HashMap uses the hash value to determine the bucket where a key-value pair should be stored.
In case of collisions, HashSet uses the equals() method to check for actual equality of elements.
In case of collisions, HashMap uses the equals() method to check for actual equality of keys.
Both HashSet and HashMap provide constant-time performance for basic operations like add, remove, and contains if the hash function is well-distributed.

Accepted Answer

I don't know about this

Top Synechron Java Developer interview questions & answers