Collections · interview question
What might cause a HashMap to degrade to O(n) performance for get() operations?
Multiple choiceHardchapter-4-curatedpremiumcollectionsmap-interface-and-hashmap
Answer and explanation
Correct answer
D. All of the above
Why
All mentioned factors can contribute to a HashMap's performance degrading to O(n). A poor hash function and too many collisions can lead to linked lists forming within buckets, increasing retrieval time.
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…