Curriculum RoadmapOfficial Source
Striver A2Z
Striver's complete step-by-step DSA preparation course sheet spanning beginner to advanced interview topics.
Total Problems: 243
Difficulty: 53 Easy·144 Medium·46 Hard
Distinct Patterns: 71
Algorithmic Pattern Breakdown
Explore sheet-specific problems by patternBinary SearchFull guide
Binary Search (Classic Lookup)
5 problems→
HashingFull guide
Hashmap Frequency / State Counting
5 problems→
HeapFull guide
Heap for Top-K / Kth Element
5 problems→
BacktrackingFull guide
Backtracking - Combinations
4 problems→
TreesFull guide
BST Ordering Property
4 problems→
Divide & ConquerFull guide
Divide and Conquer
4 problems→
Linked ListFull guide
Fast/Slow Pointers (Cycle & Midpoint)
4 problems→
Dynamic ProgrammingFull guide
Grid / 2D Path DP
4 problems→
Dynamic ProgrammingFull guide
Linear 1D DP
4 problems→
Sliding WindowFull guide
Sliding Window (Variable Size)
4 problems→
Binary SearchFull guide
Binary Search on the Answer
3 problems→
GreedyFull guide
Greedy Single-Pass Decision
3 problems→
MatrixFull guide
Matrix Traversal Simulation
3 problems→
IntervalsFull guide
Merge / Insert Intervals
3 problems→
Dynamic ProgrammingFull guide
State Machine DP
3 problems→
Dynamic ProgrammingFull guide
String Alignment / Subsequence DP
3 problems→
StringsFull guide
String Index Scanning
3 problems→
GraphsFull guide
Topological Sort
3 problems→
TreesFull guide
Tree BFS / Level-Order Traversal
3 problems→
Two PointersFull guide
Two Pointers (Opposite Ends)
3 problems→
Dynamic Programming
0/1 Knapsack
2 problems→
Backtracking
Backtracking - Subsets (Include/Exclude)
2 problems→
Binary Search
Binary Search on a Rotated Array
2 problems→
Math
Digit Manipulation Simulation
2 problems→
Graphs
Flood Fill
2 problems→
Greedy
Greedy Farthest-Reach Tracking
2 problems→
Graphs
Grid DFS Traversal
2 problems→
Hashing
Hashmap Existence / Complement Lookup
2 problems→
Linked List
Linked List In-Place Reversal
2 problems→
Trees
Lowest Common Ancestor
2 problems→
Arrays
Prefix Sum
2 problems→
Stack
Stack-Based Matching / Evaluation
2 problems→
Dynamic Programming
Take/Skip Adjacent-Constraint 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 (Same Direction)
2 problems→
Dynamic Programming
Unbounded Knapsack
2 problems→
Arrays
Array Rotation via Triple Reversal
1 problem→
Backtracking
Backtracking - Grid Path Search
1 problem→
Graphs
BFS Shortest Path (Unweighted)
1 problem→
Math
Big-Number Arithmetic Simulation
1 problem→
Bit Manipulation
Bit Manipulation - XOR Tricks
1 problem→
Graphs
Bounded-Hop Shortest Path (Bellman-Ford Style)
1 problem→
Greedy
Boyer-Moore Voting Algorithm
1 problem→
Dynamic Programming
Circular Array DP
1 problem→
Trees
Complete Tree Structural Binary Search
1 problem→
Graphs
Dijkstra's Shortest Path
1 problem→
Dynamic Programming
Expand Around Center
1 problem→
Trees
Generic Recursive Tree DFS
1 problem→
Greedy
Greedy Interval Scheduling
1 problem→
Greedy
Greedy Min/Max Range Tracking
1 problem→
Greedy
Greedy Two-Pass Comparison
1 problem→
Linked List
Hashmap Node-to-Node Mapping
1 problem→
Dynamic Programming
Interval DP
1 problem→
Arrays
Kadane's Algorithm
1 problem→
Linked List
Linked List Merge (K-Way)
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→
Sliding Window
Sliding Window (Fixed Size)
1 problem→
Two Pointers
Sort Then Two Pointers
1 problem→
Trees
Tree Serialization / Deserialization
1 problem→
Heap
Two Heaps (Median Maintenance)
1 problem→
Graphs
Union-Find / Disjoint Set
1 problem→