Collections · interview question
Which Java collection would you choose if you need to maintain insertion order and allow duplicates?
Multiple choiceEasychapter-4-curatedpremiumcollectionschoosing-the-right-collection
Answer and explanation
Correct answer
C. ArrayList
Why
ArrayList maintains the order in which elements are inserted and allows duplicates. HashSet and TreeSet do not allow duplicates, and HashMap is not a collection of values but a map of keys to values.
Test yourself on Collections
A free test with instant, explained results. No account needed.
More Collections questions
- Why do teams use a HashSet over a List when storing items in production code?
- Which Java collection should you use if you need to store elements with fast random access and allow duplicates?
- Which collection does not allow duplicate elements?
- How would you explain a key advantage of using a HashMap over a TreeMap in an interview?
- You are tasked with designing a cache system in Java where both insertion order and fast access are crucial. Which…
- You need a collection for an in-memory product catalog where order matters and items must be unique. Which collection…