Question

How does a HashSet work internally in Java?

Option 1: It uses a resizable array to store elements and ensures that no duplicate elements are allowed.
Option 2: It uses a linked list to store elements and ensures that no duplicate elements are allowed.
Option 3: It uses a balanced tree structure to store elements, providing fast access and ensuring no duplicate elements are allowed.
Option 4: It uses a fixed-size array to store elements and allows duplicates to be stored.

Answer 1

A HashSet in Java uses a hash table to store elements and ensures that no duplicate elements are allowed.

Step-by-step explanation:

A HashSet in Java uses a hash table to store elements and ensures that no duplicate elements are allowed.

Internally, the hash table is implemented as an array of LinkedList objects.

Each element is stored in a specific index of the array based on its hash code and any collisions are resolved by chaining the elements in the linked list.

This allows for fast access to elements and efficient handling of duplicates.