Collections · interview question
In Java, which collection should you use if you need fast lookup and do not care about the order of elements?
Multiple choiceMediumchapter-4-curatedpremiumcollectionschoosing-the-right-collection
Answer and explanation
Correct answer
A. HashSet
Why
HashSet provides fast lookup due to its hash-based structure and does not maintain any order. HashMap is for key-value pairs, LinkedList maintains order, and TreeMap is sorted.
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…