Collections · interview question
Why might a poorly implemented hashCode() method impact the performance of a HashMap?
Multiple choiceHardchapter-4-curatedpremiumcollectionsmap-interface-and-hashmap
Answer and explanation
Correct answer
B. It could lead to many keys being placed in the same bucket, causing collision.
Why
A poorly implemented hashCode() method that results in many keys hashing to the same bucket will increase the time complexity of get() and put() operations due to collisions, degrading performance from O(1) to O(n).
Test yourself on Collections
A free test with instant, explained results. No account needed.
More Collections questions
- Given a List<String> catalog, which method call on an Iterator<String> allows safe removal of an item during iteration?
- If you need to ensure that elements are processed in the exact order they are added but also need occasional access to…
- Given an e-commerce application that requires frequent updates and lookups of product prices, which collection would…
- Which operation is most efficient for an ArrayList?
- What will happen if you try to access an index in an ArrayList that is out of bounds?
- You need to store product IDs and ensure no duplicates, with the ability to retrieve them in sorted order. Which…