12 weeks of deliberate Blind 75 practice.
Every week combines new patterns, spaced repetition, and timed solve-from-blank sessions.
Week 1
Arrays, hashing, two pointers, and the habit of stating invariants before code.
- Contains Duplicate · Arrays & Hashing · Easy
- Valid Anagram · Arrays & Hashing · Easy
- Two Sum · Arrays & Hashing · Easy
- Group Anagrams · Arrays & Hashing · Medium
- Top K Frequent Elements · Arrays & Hashing · Medium
- Product of Array Except Self · Arrays & Hashing · Medium
- Encode and Decode Strings · Arrays & Hashing · Medium
- Longest Consecutive Sequence · Arrays & Hashing · Medium
- Valid Palindrome · Two Pointers · Easy
- 3Sum · Two Pointers · Medium
- Container With Most Water · Two Pointers · Medium
Review loop: revisit 5 earlier problems from memory, then write one paragraph explaining the invariant that made the solution work.
Week 2
Sliding windows, stack discipline, and binary-search boundary control.
- Best Time to Buy and Sell Stock · Sliding Window · Easy
- Longest Substring Without Repeating Characters · Sliding Window · Medium
- Longest Repeating Character Replacement · Sliding Window · Medium
- Minimum Window Substring · Sliding Window · Hard
- Valid Parentheses · Stack · Easy
- Find Minimum in Rotated Sorted Array · Binary Search · Medium
- Search in Rotated Sorted Array · Binary Search · Medium
Review loop: revisit 5 earlier problems from memory, then write one paragraph explaining the invariant that made the solution work.
Week 3
Linked list pointer manipulation and mutation-safe narration.
- Reverse Linked List · Linked List · Easy
- Merge Two Sorted Lists · Linked List · Easy
- Reorder List · Linked List · Medium
- Remove Nth Node From End of List · Linked List · Medium
- Linked List Cycle · Linked List · Easy
- Merge K Sorted Lists · Linked List · Hard
Review loop: revisit 5 earlier problems from memory, then write one paragraph explaining the invariant that made the solution work.
Week 4
Trees, recursion, DFS/BFS, and ancestor-bound reasoning.
- Invert Binary Tree · Trees · Easy
- Maximum Depth of Binary Tree · Trees · Easy
- Same Tree · Trees · Easy
- Subtree of Another Tree · Trees · Easy
- Lowest Common Ancestor of a Binary Search Tree · Trees · Medium
- Binary Tree Level Order Traversal · Trees · Medium
- Validate Binary Search Tree · Trees · Medium
- Kth Smallest Element in a BST · Trees · Medium
- Construct Binary Tree from Preorder and Inorder Traversal · Trees · Medium
- Binary Tree Maximum Path Sum · Trees · Hard
- Serialize and Deserialize Binary Tree · Trees · Hard
Review loop: revisit 5 earlier problems from memory, then write one paragraph explaining the invariant that made the solution work.
Week 5
Graph traversal, grid search, and visited-state design.
- Clone Graph · Graphs · Medium
- Course Schedule · Graphs · Medium
- Pacific Atlantic Water Flow · Graphs · Medium
- Number of Islands · Graphs · Medium
Review loop: revisit 5 earlier problems from memory, then write one paragraph explaining the invariant that made the solution work.
Week 6
Topological sort, graph validity, and connected components.
- Alien Dictionary · Graphs · Hard
- Graph Valid Tree · Graphs · Medium
- Number of Connected Components in an Undirected Graph · Graphs · Medium
Review loop: revisit 5 earlier problems from memory, then write one paragraph explaining the invariant that made the solution work.
Week 7
1-D DP state definition and recurrence discovery.
- Climbing Stairs · 1-D Dynamic Programming · Easy
- House Robber · 1-D Dynamic Programming · Medium
- House Robber II · 1-D Dynamic Programming · Medium
- Longest Palindromic Substring · 1-D Dynamic Programming · Medium
- Palindromic Substrings · 1-D Dynamic Programming · Medium
- Decode Ways · 1-D Dynamic Programming · Medium
Review loop: revisit 5 earlier problems from memory, then write one paragraph explaining the invariant that made the solution work.
Week 8
DP table shape, subproblem ordering, and sequence problems.
- Coin Change · 1-D Dynamic Programming · Medium
- Maximum Product Subarray · 1-D Dynamic Programming · Medium
- Word Break · 1-D Dynamic Programming · Medium
- Longest Increasing Subsequence · 1-D Dynamic Programming · Medium
- Unique Paths · 2-D Dynamic Programming · Medium
- Longest Common Subsequence · 2-D Dynamic Programming · Medium
Review loop: revisit 5 earlier problems from memory, then write one paragraph explaining the invariant that made the solution work.
Week 9
Greedy decisions and interval sorting invariants.
- Jump Game · Greedy · Medium
- Insert Interval · Intervals · Medium
- Merge Intervals · Intervals · Medium
- Non-overlapping Intervals · Intervals · Medium
- Meeting Rooms II · Intervals · Medium
Review loop: revisit 5 earlier problems from memory, then write one paragraph explaining the invariant that made the solution work.
Week 10
Backtracking trees, tries, and prefix pruning.
- Subsets · Backtracking · Medium
- Combination Sum · Backtracking · Medium
- Permutations · Backtracking · Medium
- Word Search · Backtracking · Medium
- Implement Trie Prefix Tree · Tries · Medium
- Design Add and Search Words Data Structure · Tries · Medium
- Word Search II · Tries · Hard
Review loop: revisit 5 earlier problems from memory, then write one paragraph explaining the invariant that made the solution work.
Week 11
Heaps, matrix transforms, and mixed timed review.
- Find Median from Data Stream · Heap / Priority Queue · Hard
- Set Matrix Zeroes · Math & Geometry · Medium
- Spiral Matrix · Math & Geometry · Medium
- Rotate Image · Math & Geometry · Medium
Review loop: revisit 5 earlier problems from memory, then write one paragraph explaining the invariant that made the solution work.
Week 12
Bit manipulation, weak-area remediation, and mock interview sets.
- Number of 1 Bits · Bit Manipulation · Easy
- Counting Bits · Bit Manipulation · Easy
- Missing Number · Bit Manipulation · Easy
- Reverse Bits · Bit Manipulation · Easy
- Sum of Two Integers · Bit Manipulation · Medium
Review loop: revisit 5 earlier problems from memory, then write one paragraph explaining the invariant that made the solution work.