Striver's sheet is celebrated for its progressive pedagogy. Below is the step-by-step roadmap followed in the interactive tracker:
Step 1
31 Problems
Learn the Basics
Language syntax (C++, Java, Python), basic recursion, basic math, and hashing techniques.
Step 2
7 Problems
Sorting Techniques
Selection Sort, Bubble Sort, Insertion Sort, Merge Sort, Quick Sort, and Recursive Sorting.
Step 3
40 Problems
Solve Problems on Arrays
Easy, Medium, and Hard array problems: Two Sum, Kadane's Algorithm, Next Permutation, 3Sum.
Step 4
32 Problems
Binary Search
BS on 1D Arrays, BS on Answers / Search Space, Aggressive Cows, Book Allocation, Median in 2D.
Step 5
15 Problems
Strings (Basic to Medium)
Anagrams, Palindromes, Roman to Integer, Longest Common Prefix, Substring manipulation.
Step 6
31 Problems
Learn LinkedList
Singly & Doubly Linked Lists, Cycle Detection, Reverse in K-Groups, Flattening, LRU Cache.
Step 7
24 Problems
Recursion & Backtracking
Subsets, Combination Sum, Palindrome Partitioning, N-Queens, Sudoku Solver, Word Search.
Step 8
14 Problems
Bit Manipulation
Bit tricks, Single Number, Power Set, XOR operations, Division without multiplication.
Step 9
30 Problems
Stack and Queues
Next Greater Element, Trapping Rain Water, Largest Rectangle in Histogram, Min Stack, Sliding Window Max.
Step 10
12 Problems
Sliding Window & 2 Pointers
Longest Substring Without Repeating Characters, Max Consecutive Ones III, Subarrays with K different ints.
Step 11
17 Problems
Heaps / Priority Queue
Kth Largest Element, Merge K Sorted Lists, Find Median from Data Stream, Task Scheduler.
Step 12
15 Problems
Greedy Algorithms
N Meetings in One Room, Jump Game, Job Sequencing, Minimum Platforms, Fractional Knapsack.
Step 13
38 Problems
Binary Trees
Traversals (In/Pre/Post), Height, Diameter, Balanced Tree, LCA, Top/Bottom View, Serialize/Deserialize.
Step 14
16 Problems
Binary Search Trees (BST)
Search, Insert, Delete, Kth Smallest/Largest, Validate BST, Recover BST, BST Iterator.
Step 15
54 Problems
Graphs
BFS, DFS, Cycle Detection, Topological Sort, Dijkstra, Bellman-Ford, Floyd-Warshall, Disjoint Set Union (DSU).
Step 16
56 Problems
Dynamic Programming (DP)
1D DP, 2D Grid DP, DP on Subsequences, DP on Strings, Stocks, Longest Increasing Subsequence (LIS), Partition DP.
Step 17
7 Problems
Tries
Insert, Search, Prefix Matching, Distinct Substrings, Maximum XOR of Two Numbers.
Step 18
6 Problems
Advanced Strings
KMP Algorithm, Z Algorithm, Shortest Palindrome, Rabin-Karp pattern searching.