← Back to Guide Index

Algorithmic complexity, concurrent data structures, and the N+1 problem — the performance fundamentals every Android engineer must reason about.

Chapters

#	Chapter	Topics
7	Algorithm Analysis & Big O	Complexity classes, asymptotic analysis, O(1)–O(N!), space complexity, LeetCode patterns
8	Concurrent Collections	ConcurrentHashMap, CopyOnWriteArrayList, thread-safe collections
9	The N+1 Problem	Query batching, eager/lazy loading, Room relationship strategies

---

Table of contents

• Algorithm Analysis & Big O
• ConcurrentHashMap & Concurrent Collections
• The N+1 Problem