Neetcode 150 — 12-Week Schedule

Phase 1 of Google prep. Mon–Sat schedule, Sun review. ~13 problems/week. Total 156 over 12 weeks; the extra few are buffer for re-doing hard ones.

Tip: do every problem twice. First attempt — figure out the pattern. Second attempt 3 days later — solve clean, time-boxed (Easy: 15min, Medium: 30min, Hard: 45min). Patterns stick on the second pass.

Tracking

Each completed problem = 1 entry in Life OS Module 2 with metadata { url, difficulty, time, language, attempt: 1|2 }. Weekly review on Sunday.

---

Week 1 (May 4-10) — Arrays & Hashing

• Two Sum (Easy)
• Contains Duplicate (Easy)
• Valid Anagram (Easy)
• Group Anagrams (Medium)
• Top K Frequent Elements (Medium)
• Encode and Decode Strings (Medium)
• Product of Array Except Self (Medium)
• Valid Sudoku (Medium)
• Longest Consecutive Sequence (Medium)

Week 2 (May 11-17) — Two Pointers + Sliding Window

• Valid Palindrome (Easy)
• Two Sum II (Medium)
• 3Sum (Medium)
• Container With Most Water (Medium)
• Trapping Rain Water (Hard)
• Best Time to Buy and Sell Stock (Easy)
• Longest Substring Without Repeating Characters (Medium)
• Longest Repeating Character Replacement (Medium)
• Permutation in String (Medium)
• Minimum Window Substring (Hard)
• Sliding Window Maximum (Hard)

Week 3 (May 18-24) — Stack

• Valid Parentheses (Easy)
• Min Stack (Medium)
• Evaluate Reverse Polish Notation (Medium)
• Generate Parentheses (Medium)
• Daily Temperatures (Medium)
• Car Fleet (Medium)
• Largest Rectangle in Histogram (Hard)

Week 4 (May 25-31) — Binary Search

• Binary Search (Easy)
• Search a 2D Matrix (Medium)
• Koko Eating Bananas (Medium)
• Find Minimum in Rotated Sorted Array (Medium)
• Search in Rotated Sorted Array (Medium)
• Time Based Key-Value Store (Medium)
• Median of Two Sorted Arrays (Hard)

Week 5 (Jun 1-7) — Linked List

• Reverse Linked List (Easy)
• Merge Two Sorted Lists (Easy)
• Reorder List (Medium)
• Remove Nth Node from End (Medium)
• Copy List with Random Pointer (Medium)
• Add Two Numbers (Medium)
• Linked List Cycle (Easy)
• Find the Duplicate Number (Medium)
• LRU Cache (Medium)
• Merge K Sorted Lists (Hard)
• Reverse Nodes in K-Group (Hard)

Week 6 (Jun 8-14) — Trees Part 1

• Invert Binary Tree (Easy)
• Maximum Depth of Binary Tree (Easy)
• Diameter of Binary Tree (Easy)
• Balanced Binary Tree (Easy)
• Same Tree (Easy)
• Subtree of Another Tree (Easy)
• Lowest Common Ancestor of BST (Medium)
• Binary Tree Level Order Traversal (Medium)
• Binary Tree Right Side View (Medium)
• Count Good Nodes in Binary Tree (Medium)

Week 7 (Jun 15-21) — Trees Part 2 + Tries

• Validate BST (Medium)
• Kth Smallest in BST (Medium)
• Construct Binary Tree from Preorder/Inorder (Medium)
• Binary Tree Maximum Path Sum (Hard)
• Serialize and Deserialize Binary Tree (Hard)
• Implement Trie (Medium)
• Design Add and Search Words (Medium)
• Word Search II (Hard)

Week 8 (Jun 22-28) — Heap / Priority Queue + Backtracking

• Kth Largest Element in Stream (Easy)
• Last Stone Weight (Easy)
• K Closest Points to Origin (Medium)
• Kth Largest Element in Array (Medium)
• Task Scheduler (Medium)
• Design Twitter (Medium)
• Find Median from Data Stream (Hard)
• Subsets (Medium)
• Combination Sum (Medium)
• Permutations (Medium)
• Subsets II (Medium)
• Word Search (Medium)
• Palindrome Partitioning (Medium)
• Letter Combinations of Phone Number (Medium)
• N-Queens (Hard)

Week 9 (Jun 29-Jul 5) — Graphs Part 1

• Number of Islands (Medium)
• Clone Graph (Medium)
• Max Area of Island (Medium)
• Pacific Atlantic Water Flow (Medium)
• Surrounded Regions (Medium)
• Rotting Oranges (Medium)
• Walls and Gates (Medium)
• Course Schedule (Medium)
• Course Schedule II (Medium)

Week 10 (Jul 6-12) — Graphs Part 2 + Advanced Graphs

• Redundant Connection (Medium)
• Number of Connected Components in Undirected Graph (Medium)
• Graph Valid Tree (Medium)
• Word Ladder (Hard)
• Reconstruct Itinerary (Hard)
• Min Cost to Connect All Points (Medium)
• Network Delay Time (Medium)
• Swim in Rising Water (Hard)
• Alien Dictionary (Hard)
• Cheapest Flights Within K Stops (Medium)

Week 11 (Jul 13-19) — 1-D DP

• Climbing Stairs (Easy)
• Min Cost Climbing Stairs (Easy)
• House Robber (Medium)
• House Robber II (Medium)
• Longest Palindromic Substring (Medium)
• Palindromic Substrings (Medium)
• Decode Ways (Medium)
• Coin Change (Medium)
• Maximum Product Subarray (Medium)
• Word Break (Medium)
• Longest Increasing Subsequence (Medium)
• Partition Equal Subset Sum (Medium)

Week 12 (Jul 20-26) — 2-D DP + Greedy + Intervals + Math + Bit Manipulation

• Unique Paths (Medium)
• Longest Common Subsequence (Medium)
• Best Time to Buy/Sell Stock with Cooldown (Medium)
• Coin Change II (Medium)
• Target Sum (Medium)
• Interleaving String (Medium)
• Edit Distance (Medium)
• Maximum Subarray (Medium)
• Jump Game (Medium)
• Jump Game II (Medium)
• Gas Station (Medium)
• Insert Interval (Medium)
• Merge Intervals (Medium)
• Non-overlapping Intervals (Medium)
• Meeting Rooms II (Medium)
• Single Number (Easy)
• Number of 1 Bits (Easy)
• Counting Bits (Easy)
• Reverse Bits (Easy)
• Missing Number (Easy)

---

After Week 12 (Aug onwards)

• Aug: Re-do all 150, this time clean & time-boxed. Identify weak patterns. Weak ones get +5 problems each from LeetCode tag.
• Sep: Hard 30 — pick from /r/leetcode "Google Hard" lists. Time-box 45min/problem.
• Oct: Company-tagged practice — LeetCode Premium ($35) for 1 month, do last-6-month Google-tagged top 50.

Honest expectations

• Week 1: brutal. You'll feel stupid. Everyone does. Push through.
• Week 4: patterns start clicking. Easies feel boring, Mediums no longer scare you.
• Week 8: you start seeing the matrix — most problems are <20 patterns wearing different costumes.
• Week 12: you've solved more LeetCode than 95% of devs you know. You're now interview-ready for L3 at most companies. Google L3/L4 needs another 6 months of grind.