Curriculum RoadmapOfficial Source
NeetCode 150
A comprehensive roadmap of 150 essential LeetCode coding interview questions grouped by topic and algorithmic pattern.
Total Problems: 150
Difficulty: 28 Easy·100 Medium·22 Hard
Distinct Patterns: 72
Algorithmic Pattern Breakdown
Explore sheet-specific problems by patternHeapFull guide
Heap for Top-K / Kth Element
10 problems→
Dynamic ProgrammingFull guide
Linear 1D DP
8 problems→
Dynamic ProgrammingFull guide
String Alignment / Subsequence DP
7 problems→
Linked ListFull guide
Fast/Slow Pointers (Cycle & Midpoint)
5 problems→
GreedyFull guide
Greedy Single-Pass Decision
5 problems→
GraphsFull guide
Grid DFS Traversal
5 problems→
HashingFull guide
Hashmap Frequency / State Counting
5 problems→
IntervalsFull guide
Merge / Insert Intervals
5 problems→
BacktrackingFull guide
Backtracking - Combinations
4 problems→
Binary SearchFull guide
Binary Search (Classic Lookup)
4 problems→
HashingFull guide
Hashmap Existence / Complement Lookup
4 problems→
Sliding WindowFull guide
Sliding Window (Variable Size)
4 problems→
Two PointersFull guide
Two Pointers (Opposite Ends)
4 problems→
GraphsFull guide
Union-Find / Disjoint Set
4 problems→
Binary SearchFull guide
Binary Search on the Answer
3 problems→
Bit ManipulationFull guide
Bit Manipulation - Counting/Shifting
3 problems→
Bit ManipulationFull guide
Bit Manipulation - XOR Tricks
3 problems→
TreesFull guide
BST Ordering Property
3 problems→
GraphsFull guide
Flood Fill
3 problems→
Linked ListFull guide
Linked List In-Place Reversal
3 problems→
MatrixFull guide
Matrix Traversal Simulation
3 problems→
StackFull guide
Monotonic Decreasing Stack
3 problems→
GraphsFull guide
Multi-Source BFS
3 problems→
StackFull guide
Stack-Based Matching / Evaluation
3 problems→
GraphsFull guide
Topological Sort
3 problems→
TreesFull guide
Tree Path Value Accumulation
3 problems→
TriesFull guide
Trie / Prefix Tree
3 problems→
Dynamic Programming
0/1 Knapsack
2 problems→
Backtracking
Backtracking - Grid Path Search
2 problems→
Backtracking
Backtracking - Subsets (Include/Exclude)
2 problems→
Math
Big-Number Arithmetic Simulation
2 problems→
Binary Search
Binary Search on a Rotated Array
2 problems→
Math
Digit Manipulation Simulation
2 problems→
Divide & Conquer
Divide and Conquer
2 problems→
Dynamic Programming
Expand Around Center
2 problems→
Graphs
Graph DFS Traversal
2 problems→
Greedy
Greedy Farthest-Reach Tracking
2 problems→
Dynamic Programming
Grid / 2D Path DP
2 problems→
Linked List
Linked List Merge (K-Way)
2 problems→
Sliding Window
Sliding Window (Fixed Size)
2 problems→
Dynamic Programming
Take/Skip Adjacent-Constraint DP
2 problems→
Trees
Tree BFS / Level-Order Traversal
2 problems→
Trees
Tree Height / Balance Check
2 problems→
Trees
Tree Structural Comparison
2 problems→
Dynamic Programming
Unbounded Knapsack
2 problems→
Backtracking
Backtracking - Partition/Cut Points
1 problem→
Backtracking
Backtracking - Permutations
1 problem→
Graphs
BFS Shortest Path (Unweighted)
1 problem→
Graphs
Bounded-Hop Shortest Path (Bellman-Ford Style)
1 problem→
Dynamic Programming
Circular Array DP
1 problem→
Graphs
Dijkstra's Shortest Path
1 problem→
Trees
Generic Recursive Tree DFS
1 problem→
Greedy
Greedy Interval Scheduling
1 problem→
Greedy
Greedy Min/Max Range Tracking
1 problem→
Hashing
Hashmap Grouping by Canonical Key
1 problem→
Linked List
Hashmap Node-to-Node Mapping
1 problem→
Dynamic Programming
Interval DP
1 problem→
Arrays
Kadane's Algorithm
1 problem→
Dynamic Programming
Longest Increasing Subsequence DP
1 problem→
Trees
Lowest Common Ancestor
1 problem→
Graphs
Minimum Spanning Tree (Prim's/Kruskal's)
1 problem→
Stack
Monotonic Deque
1 problem→
Stack
Monotonic Increasing Stack
1 problem→
Backtracking
N-Queens Style Constraint Backtracking
1 problem→
Math
Number Theory
1 problem→
Arrays
Prefix Sum
1 problem→
Heap
Quickselect
1 problem→
Two Pointers
Sort Then Two Pointers
1 problem→
Dynamic Programming
State Machine DP
1 problem→
Trees
Tree Reconstruction from Traversals
1 problem→
Trees
Tree Serialization / Deserialization
1 problem→
Heap
Two Heaps (Median Maintenance)
1 problem→