Curriculum RoadmapOfficial Source
Striver SDE Sheet
Tracking 119 unique LeetCode problems from the canonical 191-problem SDE Sheet (62 non-LeetCode problems omitted).
Total Problems: 119
Difficulty: 35 Easy·66 Medium·18 Hard
Distinct Patterns: 54
Algorithmic Pattern Breakdown
Explore sheet-specific problems by patternTreesFull guide
BST Ordering Property
5 problems→
Divide & ConquerFull guide
Divide and Conquer
4 problems→
Linked ListFull guide
Fast/Slow Pointers (Cycle & Midpoint)
4 problems→
HeapFull guide
Heap for Top-K / Kth Element
3 problems→
StringsFull guide
String Index Scanning
3 problems→
TreesFull guide
Tree BFS / Level-Order Traversal
3 problems→
Backtracking
Backtracking - Combinations
2 problems→
Dynamic Programming
Grid / 2D Path DP
2 problems→
Hashing
Hashmap Existence / Complement Lookup
2 problems→
Hashing
Hashmap Frequency / State Counting
2 problems→
Linked List
Linked List In-Place Reversal
2 problems→
Trees
Lowest Common Ancestor
2 problems→
Matrix
Matrix Traversal Simulation
2 problems→
Sliding Window
Sliding Window (Variable Size)
2 problems→
Dynamic Programming
String Alignment / Subsequence DP
2 problems→
Trees
Tree Height / Balance Check
2 problems→
Trees
Tree Path Value Accumulation
2 problems→
Trees
Tree Reconstruction from Traversals
2 problems→
Trees
Tree Structural Comparison
2 problems→
Tries
Trie / Prefix Tree
2 problems→
Two Pointers
Two Pointers (Opposite Ends)
2 problems→
Two Pointers
Two Pointers (Same Direction)
2 problems→
Dynamic Programming
Unbounded Knapsack
2 problems→
Backtracking
Backtracking - Permutations
1 problem→
Backtracking
Backtracking - Subsets (Include/Exclude)
1 problem→
Math
Big-Number Arithmetic Simulation
1 problem→
Binary Search
Binary Search (Classic Lookup)
1 problem→
Binary Search
Binary Search on a Rotated Array
1 problem→
Binary Search
Binary Search on the Answer
1 problem→
Greedy
Boyer-Moore Voting Algorithm
1 problem→
Dynamic Programming
Expand Around Center
1 problem→
Graphs
Flood Fill
1 problem→
Trees
Generic Recursive Tree DFS
1 problem→
Graphs
Graph DFS Traversal
1 problem→
Graphs
Grid DFS Traversal
1 problem→
Linked List
Hashmap Node-to-Node Mapping
1 problem→
Arrays
Kadane's Algorithm
1 problem→
Dynamic Programming
Linear 1D DP
1 problem→
Linked List
Linked List Merge (K-Way)
1 problem→
Intervals
Merge / Insert Intervals
1 problem→
Stack
Monotonic Decreasing Stack
1 problem→
Stack
Monotonic Deque
1 problem→
Stack
Monotonic Increasing Stack
1 problem→
Strings
Multi-Pass String Construction
1 problem→
Graphs
Multi-Source BFS
1 problem→
Backtracking
N-Queens Style Constraint Backtracking
1 problem→
Math
Number Theory
1 problem→
Heap
Quickselect
1 problem→
Sliding Window
Sliding Window (Fixed Size)
1 problem→
Two Pointers
Sort Then Two Pointers
1 problem→
Stack
Stack-Based Matching / Evaluation
1 problem→
Graphs
Topological Sort
1 problem→
Trees
Tree Serialization / Deserialization
1 problem→
Heap
Two Heaps (Median Maintenance)
1 problem→