How the plan works

Each day takes about one hour: 15 minutes of concepts, 35 minutes of problems (at least two every day) and 10 minutes of review, for eight weeks. Days unlock in order, and FeatCode tracks your progress day by day and week by week. The plan covers all 75 Blind 75 problems, with Python templates for every pattern.

Week 1: Hashing & Two Pointers (Days 1–7)

Reach for a hash map before a nested loop, and know when two pointers apply.

Day 1: Hash sets & counting — Contains Duplicate, Valid Anagram
Day 2: Hash maps: complements & grouping — Two Sum, Group Anagrams
Day 3: Frequency counting & top-K — Top K Frequent Elements, Longest Consecutive Sequence
Day 4: Prefix & suffix thinking — Product of Array Except Self, Encode and Decode Strings
Day 5: Two pointers: converging — Valid Palindrome, Container With Most Water
Day 6: Sort first, then two pointers: 3Sum — 3Sum, Two Sum II Input Array Is Sorted
Day 7: Week 1 review: Hashing & Two Pointers — Two Sum, Group Anagrams

Week 2: Stacks, Binary Search & Sliding Window (Days 8–14)

Spot ordering, sorted data and contiguous ranges, and pick the matching tool.

Day 8: Stacks: last in, first out — Valid Parentheses, Min Stack
Day 9: Monotonic stack — Daily Temperatures, Car Fleet
Day 10: Binary search: the template — Binary Search, Search a 2D Matrix
Day 11: Binary search on rotated arrays & answers — Find Minimum In Rotated Sorted Array, Search In Rotated Sorted Array
Day 12: Sliding window: grow, then shrink — Best Time to Buy And Sell Stock, Longest Substring Without Repeating Characters
Day 13: Sliding window with counts — Longest Repeating Character Replacement, Permutation In String
Day 14: Week 2 review: Stack, Binary Search & Sliding Window — Valid Parentheses, Longest Substring Without Repeating Characters

Week 3: Linked Lists & Trees I (Days 15–21)

Handle pointers safely and think recursively about trees.

Day 15: Linked lists: pointers & cycles — Reverse Linked List, Merge Two Sorted Lists, Linked List Cycle
Day 16: Fast & slow pointers with a gap — Remove Nth Node From End of List, Add Two Numbers
Day 17: Combining techniques: Reorder List — Reorder List, Copy List With Random Pointer
Day 18: Binary trees: recursion — Invert Binary Tree, Maximum Depth of Binary Tree, Same Tree
Day 19: Level order (BFS) & height-based DFS — Binary Tree Level Order Traversal, Diameter of Binary Tree
Day 20: Binary search trees — Validate Binary Search Tree, Kth Smallest Element In a Bst
Day 21: Week 3 review: Linked Lists & Trees I — Reverse Linked List, Binary Tree Level Order Traversal

Week 4: Trees II, Tries, Heaps & Backtracking (Days 22–28)

Choose the right structure for prefixes and top-K, and meet backtracking.

Day 22: Trees: LCA & balance — Lowest Common Ancestor of a Binary Search Tree, Balanced Binary Tree
Day 23: Building & serializing trees — Construct Binary Tree From Preorder And Inorder Traversal, Count Good Nodes In Binary Tree
Day 24: Tries (prefix trees) — Implement Trie Prefix Tree, Design Add And Search Words Data Structure
Day 25: Heaps: top-K — Last Stone Weight, Kth Largest Element In An Array
Day 26: Heaps: distance, scheduling & two heaps — K Closest Points to Origin, Task Scheduler
Day 27: Backtracking: choose, explore, undo — Subsets, Permutations
Day 28: Week 4 review: Trees II, Tries, Heaps & Backtracking — Implement Trie Prefix Tree, Last Stone Weight

Week 5: Backtracking & Graphs (Days 29–35)

Search every possibility, and traverse graphs and grids with BFS and DFS.

Day 29: Backtracking: combinations & reuse — Combination Sum, Combination Sum II
Day 30: Backtracking on a grid — Word Search, Palindrome Partitioning
Day 31: Graphs: grids & flood fill — Number of Islands, Max Area of Island
Day 32: Graphs: adjacency lists & cloning — Clone Graph, Rotting Oranges
Day 33: Topological sort & cycle detection — Course Schedule, Course Schedule II
Day 34: Reverse thinking: multi-source search — Pacific Atlantic Water Flow, Surrounded Regions
Day 35: Week 5 review: Backtracking & Graphs — Word Search, Number of Islands

Week 6: Advanced Graphs & 1-D DP (Days 36–42)

Add Union-Find and Dijkstra, then start thinking in subproblems.

Day 36: Union-Find (disjoint set) — Number of Connected Components In An Undirected Graph, Graph Valid Tree
Day 37: Shortest paths: Dijkstra — Network Delay Time, Min Cost to Connect All Points
Day 38: Dynamic programming: the idea — Climbing Stairs, House Robber
Day 39: DP: choosing from many options (Coin Change) — Coin Change, House Robber II
Day 40: DP on sequences: LIS & Word Break — Longest Increasing Subsequence, Word Break
Day 41: DP on strings: expand around the center — Longest Palindromic Substring, Palindromic Substrings
Day 42: Week 6 review: Advanced Graphs & 1-D DP — Climbing Stairs, Coin Change

Week 7: 2-D DP, Greedy & Intervals (Days 43–49)

Extend DP to two dimensions and learn when a local choice is enough.

Day 43: 2-D DP: grids — Unique Paths, Coin Change II
Day 44: 2-D DP: two strings (LCS) — Longest Common Subsequence, Edit Distance
Day 45: Greedy: local choices (Kadane) — Maximum Subarray, Gas Station
Day 46: Greedy: reachability — Jump Game, Jump Game II
Day 47: Intervals: sort & merge — Meeting Rooms, Merge Intervals
Day 48: Intervals: greedy by end time & sweeping — Non Overlapping Intervals, Meeting Rooms II
Day 49: Week 7 review: 2-D DP, Greedy & Intervals — Longest Increasing Subsequence, Maximum Subarray

Week 8: Math, Bits & Mock Interviews (Days 50–56)

Fill the last gaps, then rehearse the real thing with timed mocks.

Day 50: Math & matrices — Happy Number, Rotate Image
Day 51: Bit manipulation — Number of 1 Bits, Counting Bits, Missing Number
Day 52: Mock 1: the interview framework & thinking aloud — Plus One, Pow(x, n)
Day 53: Mock 2: testing & complexity — Generate Parentheses, Time Based Key Value Store
Day 54: Picking the right pattern & getting unstuck — Find The Duplicate Number, Valid Sudoku
Day 55: Assessment day: find your last gaps
Day 56: Final day: interview-day checklist — Contains Duplicate, Valid Anagram