Topic Guide
Coding Patterns
Stop memorizing solutions. Learn the underlying patterns that let you solve any coding interview problem. Two pointers, sliding window, backtracking, and more.
12 guides in this collection
Interval Problems: Complete Interview Guide
Master interval problems for coding interviews. Learn to merge overlapping intervals, find gaps, and solve meeting rooms problems.
Greedy Algorithms: Complete Interview Guide
Master greedy algorithms for coding interviews. Learn when greedy works, common patterns like jump game and task scheduler.
Backtracking: Complete Interview Guide
Master backtracking for coding interviews. Learn the universal template for subsets, permutations, combinations, and constraint satisfaction.
Stack Pattern: Complete Interview Guide
Master stack patterns for coding interviews. Learn matching brackets, monotonic stack, expression evaluation, and common LeetCode problems.
Linked List Pattern Explained
Master linked list techniques for coding interviews. Learn singly vs doubly lists, cycle detection, in-place reversal, and the dummy head technique.
Binary Search: The Complete Interview Guide
Master binary search for coding interviews. Learn the template, common variations (lower/upper bound), and how to avoid off-by-one errors.
Dynamic Programming: A Practical Guide
Master dynamic programming with this step-by-step guide. Learn the patterns, recognize DP problems, and solve them systematically with real interview examples.
Two Pointers Pattern Explained
Master the two pointers technique for solving array and string problems efficiently. Learn when to use it and common problem patterns.
Sliding Window: When and How to Use It
Understand the sliding window pattern for solving subarray and substring problems. Includes fixed-size and dynamic window examples.
Matrix Traversal Patterns: DFS, BFS & Path Finding
Master matrix/grid traversal patterns including DFS, BFS, flood fill, islands, and shortest path algorithms for coding interviews.
Monotonic Stack and Queue: Interview Pattern Guide
Master monotonic stack and queue patterns for next greater element, sliding window maximum, and histogram problems.
Top K Elements Pattern: Heap Interview Guide
Master the Top K elements pattern using heaps for finding largest/smallest K elements, Kth largest, and frequency problems.
Ready to Practice?
Apply what you've learned. 1,300+ questions with spaced repetition scheduled for interview day.