Collections · interview question
How would you explain the expected time complexity of get() and put() operations in a HashMap in an interview?
Multiple choiceHardchapter-4-curatedpremiumcollectionsmap-interface-and-hashmap
Answer and explanation
Correct answer
B. O(1)
Why
In the average case, HashMap operations like get() and put() have a time complexity of O(1) due to the hash-based indexing. However, in the worst case, due to hash collisions, operations might degrade 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…