Curriculum RoadmapOfficial Source
Blind 75
The original curated list of 75 high-frequency questions covering the most critical coding interview patterns.
Total Problems: 75
Difficulty: 19 Easy·49 Medium·7 Hard
Distinct Patterns: 47
Algorithmic Pattern Breakdown
Explore sheet-specific problems by patternDynamic ProgrammingFull guide
Linear 1D DP
7 problems→
IntervalsFull guide
Merge / Insert Intervals
5 problems→
Sliding WindowFull guide
Sliding Window (Variable Size)
4 problems→
Bit ManipulationFull guide
Bit Manipulation - Counting/Shifting
3 problems→
TreesFull guide
BST Ordering Property
3 problems→
Linked ListFull guide
Fast/Slow Pointers (Cycle & Midpoint)
3 problems→
HashingFull guide
Hashmap Existence / Complement Lookup
3 problems→
HashingFull guide
Hashmap Frequency / State Counting
3 problems→
HeapFull guide
Heap for Top-K / Kth Element
3 problems→
MatrixFull guide
Matrix Traversal Simulation
3 problems→
Dynamic ProgrammingFull guide
String Alignment / Subsequence DP
3 problems→
TriesFull guide
Trie / Prefix Tree
3 problems→
Backtracking
Backtracking - Grid Path Search
2 problems→
Binary Search
Binary Search on a Rotated Array
2 problems→
Bit Manipulation
Bit Manipulation - XOR Tricks
2 problems→
Dynamic Programming
Expand Around Center
2 problems→
Graphs
Grid DFS Traversal
2 problems→
Linked List
Linked List In-Place Reversal
2 problems→
Linked List
Linked List Merge (K-Way)
2 problems→
Dynamic Programming
Take/Skip Adjacent-Constraint DP
2 problems→
Graphs
Topological Sort
2 problems→
Trees
Tree Structural Comparison
2 problems→
Two Pointers
Two Pointers (Opposite Ends)
2 problems→
Dynamic Programming
Unbounded Knapsack
2 problems→
Graphs
Union-Find / Disjoint Set
2 problems→
Dynamic Programming
Circular Array DP
1 problem→
Divide & Conquer
Divide and Conquer
1 problem→
Graphs
Flood Fill
1 problem→
Trees
Generic Recursive Tree DFS
1 problem→
Graphs
Graph DFS Traversal
1 problem→
Greedy
Greedy Farthest-Reach Tracking
1 problem→
Greedy
Greedy Interval Scheduling
1 problem→
Dynamic Programming
Grid / 2D Path DP
1 problem→
Hashing
Hashmap Grouping by Canonical Key
1 problem→
Arrays
Kadane's Algorithm
1 problem→
Dynamic Programming
Longest Increasing Subsequence DP
1 problem→
Trees
Lowest Common Ancestor
1 problem→
Graphs
Multi-Source BFS
1 problem→
Arrays
Prefix Sum
1 problem→
Two Pointers
Sort Then Two Pointers
1 problem→
Stack
Stack-Based Matching / Evaluation
1 problem→
Trees
Tree BFS / Level-Order Traversal
1 problem→
Trees
Tree Height / Balance Check
1 problem→
Trees
Tree Path Value Accumulation
1 problem→
Trees
Tree Reconstruction from Traversals
1 problem→
Trees
Tree Serialization / Deserialization
1 problem→
Heap
Two Heaps (Median Maintenance)
1 problem→