Learning path

Java collections for backend developers

A curated path through 11 Java collection guides, built around practical backend choices: maps, equality, hashing, sets, lists, queues, concurrency, memory, and complexity.

6 guides

Map fundamentals

Start with HashMap behavior, TreeMap ordering, legacy Hashtable differences, load factor tuning, and concurrent map choices.

5 guides

Equality and hashing

Understand equals, hashCode, key mutability, collision handling, and why hash-based collections behave the way they do.

3 guides

Set choices

Compare hash-based uniqueness with sorted set behavior, range navigation, comparator rules, and membership checks.

3 guides

List choices

Compare ArrayList and LinkedList through access patterns, insertion cost, memory overhead, and backend usage.

4 guides

Queues and priority

Choose between FIFO queues, double-ended queues, heap-backed priority queues, and algorithmic top-K patterns.

4 guides

Complexity and performance

Use Big-O as a practical language for collection choices, hot paths, memory overhead, and code reviews.

Start here

Pillar guides

These articles are the strongest entry points into the Java collections cluster.

Java Jan 8, 2026 4 min read

HashMap vs Hashtable in Java: Key Differences

Compare HashMap and Hashtable in Java, including synchronization, null keys, performance, legacy status, and modern alternatives.

Java Jun 30, 2026 4 min read

TreeMap vs HashMap in Java

Compare TreeMap and HashMap in Java by key ordering, lookup complexity, range queries, null handling, memory overhead, and backend use cases.

Java Jun 30, 2026 4 min read

HashSet vs TreeSet in Java

Compare HashSet and TreeSet in Java by ordering, uniqueness, contains performance, null handling, memory cost, and practical backend use cases.

Java Mar 1, 2026 4 min read

ArrayList vs LinkedList in Java

Compare ArrayList and LinkedList in Java by access patterns, insertion cost, memory overhead, and practical backend usage.

Java Jun 30, 2026 4 min read

Queue vs Deque in Java

Compare Queue and Deque in Java, including FIFO queues, double-ended operations, ArrayDeque, LinkedList, stack usage, and practical backend defaults.

Java Jan 14, 2026 4 min read

Java PriorityQueue Explained with Practical Examples

Learn how Java PriorityQueue works, when to use it, how ordering is defined, and common pitfalls around iteration and custom comparators.

Java Jul 1, 2026 5 min read

Java equals and hashCode Explained

Learn Java equals and hashCode contracts, why they matter for HashMap and HashSet, common mistakes, records, mutability, and testing.

Java Jul 1, 2026 5 min read

HashMap Collision Handling Explained

Learn how HashMap collision handling works in Java, including buckets, hashCode, equals, tree bins, load factor, bad keys, and performance.

Java Mar 8, 2026 4 min read

HashMap Load Factor Explained

Learn what HashMap load factor means in Java, how it affects resizing, memory usage, collision risk, and lookup performance.

Java Mar 15, 2026 4 min read

ConcurrentHashMap Explained

A practical explanation of ConcurrentHashMap in Java, including thread safety, atomic methods, iteration behavior, and common mistakes.

Java May 10, 2026 6 min read

Time Complexity of Java Collections

A practical reference for Java collection time complexity, including ArrayList, LinkedList, HashMap, TreeMap, HashSet, and PriorityQueue.

How to study

Choose collections by workflow.

Java collection choices are rarely about one method in isolation. A backend workflow may build a collection, search it, mutate it, serialize it, and share it across threads.

Start with defaults: ArrayList for most lists, HashMap for key-value lookup, HashSet for membership checks, ArrayDeque for simple queues, and PriorityQueue for repeated priority-based removal.

Use the Big-O Cheat Sheet while comparing operations, then browse Topics for adjacent Java, algorithms, and backend architecture clusters.

FAQ

Java collections learning questions

Which Java collection should I learn first?

Start with ArrayList, HashMap, HashSet, ArrayDeque, and PriorityQueue, then learn equals, hashCode, and collision behavior for reliable hash-based collections.

Should I use ArrayList or LinkedList by default?

Use ArrayList by default for most Java application code. LinkedList is useful only for narrower insertion or removal patterns where the position is already known.

When should I use ConcurrentHashMap?

Use ConcurrentHashMap when multiple threads need shared map access. For request-scoped or method-local maps, a regular HashMap is usually simpler.

How should I study Java collection complexity?

Compare the whole workflow: building, lookup, iteration, removal, sorting, range navigation, serialization, and thread ownership. Big-O is useful, but memory and ownership matter too.