Collections · interview question
You have a list of product descriptions that are mostly accessed in sequential order but occasionally need to be searched. Which collection is generally more efficient?
Multiple choiceMediumchapter-4-curatedpremiumcollectionscollection-performance-basics
Answer and explanation
Correct answer
A. ArrayList
Why
ArrayList is efficient for sequential access due to its underlying array structure, offering O(1) access time. However, searching is O(n), which is acceptable given the sporadic need.
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…