← Exit to Module 11: Collections Framework Deep Dive lessons
Module progress · 0%Lesson · 18 min
Module 11: Collections Framework Deep Dive
Lesson focusList Implementations: ArrayList, LinkedList, Vector
Compare performance characteristics and use cases.
01 · 14 minCollections Hierarchy OverviewLocked02 · 18 minList Implementations: ArrayList, LinkedList, VectorLocked03 · 20 minSet Implementations: HashSet, TreeSet, LinkedHashSetLocked04 · 22 minMap Implementations: HashMap, TreeMap, LinkedHashMapLocked05 · 16 minQueue & Deque ImplementationsLocked06 · 12 minComparable vs ComparatorLocked07 · 12 minCollections Utility ClassLocked08 · 14 minIteration Techniques & Fail-Fast BehaviorLocked09 · 35 minMini-Project: Contact Management SystemLocked
ArrayList: O(1) random access, amortized O(1) insertion at end.
LinkedList: O(1) insertion/removal at ends but O(n) access—great for deque usage.
Vector is synchronized legacy; prefer ArrayList plus explicit synchronization or CopyOnWriteArrayList.