Curriculum RoadmapOfficial Source
LeetCode Top Interview 150
Official LeetCode study plan covering standard interview problem archetypes and data structures.
Total Problems: 150
Difficulty: 40 Easy·91 Medium·19 Hard
Distinct Patterns: 67
Algorithmic Pattern Breakdown
Explore sheet-specific problems by patternDivide & ConquerFull guide
Divide and Conquer
6 problems→
HashingFull guide
Hashmap Frequency / State Counting
6 problems→
Two PointersFull guide
Two Pointers (Same Direction)
6 problems→
TreesFull guide
BST Ordering Property
5 problems→
Linked ListFull guide
Fast/Slow Pointers (Cycle & Midpoint)
5 problems→
HashingFull guide
Hashmap Existence / Complement Lookup
5 problems→
MatrixFull guide
Matrix Traversal Simulation
5 problems→
StringsFull guide
String Index Scanning
5 problems→
TreesFull guide
Tree BFS / Level-Order Traversal
5 problems→
Two PointersFull guide
Two Pointers (Opposite Ends)
5 problems→
BacktrackingFull guide
Backtracking - Combinations
4 problems→
Binary SearchFull guide
Binary Search (Classic Lookup)
4 problems→
Bit ManipulationFull guide
Bit Manipulation - Counting/Shifting
4 problems→
GreedyFull guide
Greedy Single-Pass Decision
4 problems→
Dynamic ProgrammingFull guide
Grid / 2D Path DP
4 problems→
HeapFull guide
Heap for Top-K / Kth Element
4 problems→
Sliding WindowFull guide
Sliding Window (Variable Size)
4 problems→
StackFull guide
Stack-Based Matching / Evaluation
4 problems→
Dynamic ProgrammingFull guide
String Alignment / Subsequence DP
4 problems→
TriesFull guide
Trie / Prefix Tree
4 problems→
GraphsFull guide
BFS Shortest Path (Unweighted)
3 problems→
Dynamic ProgrammingFull guide
Linear 1D DP
3 problems→
IntervalsFull guide
Merge / Insert Intervals
3 problems→
StringsFull guide
Multi-Pass String Construction
3 problems→
MathFull guide
Number Theory
3 problems→
TreesFull guide
Tree Path Value Accumulation
3 problems→
Backtracking
Backtracking - Grid Path Search
2 problems→
Math
Big-Number Arithmetic Simulation
2 problems→
Binary Search
Binary Search on a Rotated Array
2 problems→
Binary Search
Binary Search on the Answer
2 problems→
Bit Manipulation
Bit Manipulation - XOR Tricks
2 problems→
Math
Digit Manipulation Simulation
2 problems→
Graphs
Flood Fill
2 problems→
Trees
Generic Recursive Tree DFS
2 problems→
Graphs
Graph DFS Traversal
2 problems→
Greedy
Greedy Farthest-Reach Tracking
2 problems→
Graphs
Grid DFS Traversal
2 problems→
Arrays
Kadane's Algorithm
2 problems→
Linked List
Linked List In-Place Reversal
2 problems→
Linked List
Linked List Merge (K-Way)
2 problems→
Arrays
Prefix Sum
2 problems→
Sliding Window
Sliding Window (Fixed Size)
2 problems→
Dynamic Programming
State Machine DP
2 problems→
Graphs
Topological Sort
2 problems→
Trees
Tree Reconstruction from Traversals
2 problems→
Trees
Tree Structural Comparison
2 problems→
Arrays
Array Rotation via Triple Reversal
1 problem→
Backtracking
Backtracking - Permutations
1 problem→
Greedy
Boyer-Moore Voting Algorithm
1 problem→
Trees
Complete Tree Structural Binary Search
1 problem→
Dynamic Programming
Expand Around Center
1 problem→
Greedy
Greedy Interval Scheduling
1 problem→
Greedy
Greedy Two-Pass Comparison
1 problem→
Hashing
Hashmap Grouping by Canonical Key
1 problem→
Linked List
Hashmap Node-to-Node Mapping
1 problem→
Linked List
Linked List Partition / Splice
1 problem→
Dynamic Programming
Longest Increasing Subsequence DP
1 problem→
Trees
Lowest Common Ancestor
1 problem→
Stack
Monotonic Decreasing Stack
1 problem→
Stack
Monotonic Deque
1 problem→
Backtracking
N-Queens Style Constraint Backtracking
1 problem→
Heap
Quickselect
1 problem→
Two Pointers
Sort Then Two Pointers
1 problem→
Dynamic Programming
Take/Skip Adjacent-Constraint DP
1 problem→
Trees
Tree Height / Balance Check
1 problem→
Heap
Two Heaps (Median Maintenance)
1 problem→
Dynamic Programming
Unbounded Knapsack
1 problem→