Java Collections Framework Interview Questions and Answers

The Java Collections Framework is a core component of the Java language and a frequent topic in technical interviews.

1. What is the Java Collections Framework and its advantages?

It unifies all collection interfaces, implementations, and algorithms, reducing development cost, improving code quality, lowering maintenance effort, and enhancing reusability.

2. What are the benefits of generics in the collection framework?

Generics provide compile‑time type safety, eliminate ClassCastException at runtime, make code cleaner by removing explicit casts, and avoid extra type‑checking bytecode.

3. What are the fundamental interfaces of the collection framework?

Core interfaces include Collection (root), Set, List, and Map, with additional interfaces such as Queue, Deque, SortedSet, SortedMap, and ListIterator.

4. Why doesn’t Collection extend Cloneable and Serializable ?

Cloning and serialization semantics depend on concrete implementations; forcing them on all collections would reduce flexibility.

5. Why doesn’t Map extend Collection ?

Map stores key‑value pairs, not a simple collection of elements, so inheriting Collection would be semantically incorrect.

6. What is an Iterator ?

An Iterator provides a way to traverse any Collection, allowing element removal during iteration.

7. Differences between Enumeration and Iterator ?

Iterator

is faster, uses less memory, and is fail‑fast; it also supports element removal, unlike Enumeration.

8. Why is there no Iterator.add() method?

Adding elements via an iterator would break its defined traversal contract; ListIterator provides an add operation with defined ordering.

9. Why doesn’t Iterator have a method to peek the next element without moving the cursor?

Such a method is rarely needed and would add unnecessary complexity to the interface.

10. Differences between Iterator and ListIterator ?

ListIterator

works only on List, supports bidirectional traversal, and adds methods for adding, replacing, and accessing previous/next indices.

11. What does the fail‑fast property of an iterator mean?

If the underlying collection is structurally modified during iteration, the iterator throws ConcurrentModificationException (except for concurrent collections).

12. Difference between fail‑fast and fail‑safe?

Fail‑fast iterators detect concurrent modifications and throw an exception; fail‑safe iterators work on a cloned snapshot and never throw the exception.

13. How to avoid ConcurrentModificationException when iterating?

Use concurrent collection classes such as CopyOnWriteArrayList instead of ArrayList.

14. Why doesn’t Iterator have a concrete implementation?

Implementations are provided by each concrete collection class, allowing them to choose fail‑fast or fail‑safe behavior.

15. What is UnsupportedOperationException ?

An exception indicating that a particular operation is not supported, commonly thrown by unmodifiable collection wrappers.

16. Importance of hashCode() and equals() ?

They determine key placement and lookup in hash‑based collections; correct implementation is essential for proper behavior.

17. What collection views does Map provide?

keySet()

, values(), and entrySet(), each reflecting changes in the underlying map.

18. Differences between HashMap and Hashtable ?

HashMap

allows null keys/values and is unsynchronized; Hashtable is synchronized, disallows nulls, and has different iteration semantics.

19. When to choose HashMap vs TreeMap ?

Use HashMap for fast insert/lookup; use TreeMap when ordered keys are required.

20. Differences between ArrayList and Vector ?

Both are index‑based, but Vector is synchronized and generally slower; ArrayList is unsynchronized and faster.

21. Differences between arrays and ArrayList ?

Arrays hold primitives and have fixed size; ArrayList holds objects, resizes automatically, and offers richer APIs.

22. Differences between ArrayList and LinkedList ?

ArrayList

provides O(1) random access; LinkedList offers faster insert/delete in the middle but slower random access and higher memory overhead.

23. Which collection classes provide random access?

ArrayList

, HashMap, TreeMap, and Hashtable.

24. Which collection classes are thread‑safe?

Vector

, Hashtable, Properties, Stack, and concurrent collections from java.util.concurrent (e.g., CopyOnWriteArrayList, ConcurrentHashMap).

25. What are concurrent collection classes?

Classes in java.util.concurrent that allow safe modification during iteration, such as CopyOnWriteArrayList and ConcurrentHashMap.

26. What are queues and stacks, and how do they differ?

Queues follow FIFO order; stacks follow LIFO. Queue is an interface, Deque allows double‑ended operations, while Stack is a class extending Vector.

27. What is the Collections class?

A utility class providing static methods for operating on or returning collections, including sorting, searching, and synchronization wrappers.

28. Difference between Comparable and Comparator ?

Comparable

defines natural ordering within a class; Comparator defines external ordering strategies.

29. How to sort a group of objects?

Use Arrays.sort() for arrays or Collections.sort() for lists, optionally providing a Comparator.

30. How to make a collection passed to a method unmodifiable?

Wrap it with Collections.unmodifiableCollection(collection), which throws UnsupportedOperationException on modification attempts.