Coding Interview Patterns
Practical problem-solving patterns and structured thinking.
24 chapters · first 2 free to read
Chapters
- Chapter 1: How to Use This Book · Free
- Chapter 2: Complexity Analysis Essentials · Free
- Chapter 3: Two Pointers
- Chapter 4: Fast & Slow Pointers
- Chapter 5: Sliding Window
- Chapter 6: Merge Intervals
- Chapter 7: Binary Search
- Chapter 8: Linked List Manipulation
- Chapter 9: Stack & Monotonic Stack
- Chapter 10: Heap / Priority Queue (Top K Elements)
- Chapter 11: Binary Tree Traversal
- Chapter 12: Binary Search Tree (BST)
- Chapter 13: Tries (Prefix Trees)
- Chapter 14: Backtracking
- Chapter 15: Graph Traversal (BFS & DFS)
- Chapter 16: Advanced Graph Algorithms
- Chapter 17: Dynamic Programming - 1D
- Chapter 18: Dynamic Programming - 2D
- Chapter 19: Bit Manipulation
- Chapter 20: Math & Geometry
- Chapter 21: Problem-Solving Strategies
- Chapter 22: Pattern Quick Reference
- Chapter 23: Mock Interview Problems
- Chapter 24: Final Review & Next Steps