Collections · interview question
How would you explain the time complexity of checking if an element exists in a HashSet, assuming a good hash function in an interview?
Multiple choiceMediumchapter-4-curatedpremiumcollectionsset-interface-and-hashset
Answer and explanation
Correct answer
A. O(1)
Why
With a good hash function, checking if an element exists in a HashSet is O(1), as it directly accesses the bucket where the element would be placed.
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…