Core Java · interview question
What issue can arise if two unequal objects have the same hashCode in a HashSet?
Multiple choiceHardchapter-4-curatedpremiumcore-javaequals-and-hashcode-in-collections
Answer and explanation
Correct answer
D. Both objects might end up in the same bucket, increasing lookup time.
Why
If two unequal objects have the same hashCode, they will be placed in the same bucket, which can increase lookup time. The HashSet will handle this by maintaining a linked list (or a tree structure in the case of a large number of collisions) within the bucket, and it will use the equals method to distinguish between the objects.
Test yourself on Core Java
A free test with instant, explained results. No account needed.
More Core Java questions
- In a console shopping cart application, why might you separate input handling from calculations?
- What happens if a subclass does not implement an abstract method from its superclass?
- Why would you choose to use a switch statement instead of multiple if-else statements for handling order status?
- Which part of the following code is responsible for avoiding an off-by-one error?
- Why can using overly complex methods in an e-commerce application become a problem in production code?
- How can a class implementing an interface with a default method call that method from within an overridden method?