Home Cheat Sheets Java Collections Cheat Sheet
📋 CHEAT SHEET

Java Collections Cheat Sheet

Quick reference for Java Collections — ArrayList, LinkedList, HashMap, TreeMap, HashSet, TreeSet, Queue and more. When to use which.

Read Full Tutorial →

List Implementations

ClassOrderedDuplicatesNullThread-safeBest for
ArrayList✅ Yes✅ Yes✅ Yes❌ NoRandom access, iteration
LinkedList✅ Yes✅ Yes✅ Yes❌ NoFrequent insert/delete at ends
Vector✅ Yes✅ Yes✅ Yes✅ YesLegacy — use ArrayList instead
CopyOnWriteArrayList✅ Yes✅ Yes✅ Yes✅ YesRead-heavy concurrent access

Map Implementations

ClassOrderedNull KeyThread-safeBest for
HashMap❌ No✅ Yes (1)❌ NoGeneral purpose key-value
LinkedHashMap✅ Insertion✅ Yes (1)❌ NoPreserve insertion order
TreeMap✅ Sorted❌ No❌ NoSorted keys, range queries
Hashtable❌ No❌ No✅ YesLegacy — use ConcurrentHashMap
ConcurrentHashMap❌ No❌ No✅ YesConcurrent read/write
EnumMap✅ Enum order❌ No❌ NoEnum keys — very fast

Set Implementations

ClassOrderedNullThread-safeBest for
HashSet❌ No✅ Yes (1)❌ NoFast lookup, no duplicates
LinkedHashSet✅ Insertion✅ Yes (1)❌ NoUnique elements, preserve order
TreeSet✅ Sorted❌ No❌ NoSorted unique elements
EnumSet✅ Enum order❌ No❌ NoEnum values — extremely fast

Queue & Deque

ClassFIFO/LIFONullThread-safeBest for
ArrayDequeBoth❌ No❌ NoStack or queue — faster than Stack/LinkedList
LinkedListBoth✅ Yes❌ NoQueue with null elements
PriorityQueuePriority❌ No❌ NoMin/max heap, task scheduling
ArrayBlockingQueueFIFO❌ No✅ YesBounded producer-consumer
LinkedBlockingQueueFIFO❌ No✅ YesUnbounded producer-consumer

Time Complexity Quick Reference

OperationArrayListLinkedListHashMapTreeMap
get(i)O(1)O(n)O(1) avgO(log n)
add(e)O(1) amortO(1)O(1) avgO(log n)
remove(i)O(n)O(n)O(1) avgO(log n)
contains(e)O(n)O(n)O(1) avgO(log n)
size()O(1)O(1)O(1)O(1)
More Cheat Sheets
Java Streams API Cheat SheetPython Built-in Functions Cheat SheetSQL Joins Cheat SheetDocker Commands Cheat SheetJVM Memory Model DiagramHow HashMap Works InternallyMicroservices Architecture DiagramPandas Cheat Sheet