NeetCode 150 - 8 Week Study Plan

Overview

• Total Questions: 150
• Duration: 8 weeks (weekdays only)
• Total Study Days: 40 days (5 days × 8 weeks)
• Questions per Day: ~4 questions (150 ÷ 40 = 3.75, rounded up)

Weekly Breakdown

Week 1: Arrays & Hashing + Two Pointers

Days 1-5 (20 questions)

• Day 1: Arrays & Hashing (4 questions)
  • Contains Duplicate
  • Valid Anagram
  • Two Sum
  • Group Anagrams
• Day 2: Arrays & Hashing (4 questions)
  • Top K Frequent Elements
  • Product of Array Except Self
  • Valid Sudoku
  • Encode and Decode Strings
• Day 3: Arrays & Hashing (4 questions)
  • Longest Consecutive Sequence
  • Two Pointers - Valid Palindrome
  • Two Sum II - Input Array Is Sorted
  • 3Sum
• Day 4: Two Pointers (4 questions)
  • Container With Most Water
  • Trapping Rain Water
  • Stack - Valid Parentheses
  • Min Stack
• Day 5: Stack (4 questions)
  • Evaluate Reverse Polish Notation
  • Generate Parentheses
  • Daily Temperatures
  • Car Fleet

Week 2: Binary Search + Sliding Window

Days 6-10 (20 questions)

• Day 6: Binary Search (4 questions)
  • Binary Search
  • Search a 2D Matrix
  • Koko Eating Bananas
  • Find Minimum in Rotated Sorted Array
• Day 7: Binary Search (4 questions)
  • Search in Rotated Sorted Array
  • Time Based Key-Value Store
  • Median of Two Sorted Arrays
  • Sliding Window - Best Time to Buy and Sell Stock
• Day 8: Sliding Window (4 questions)
  • Longest Substring Without Repeating Characters
  • Longest Repeating Character Replacement
  • Permutation in String
  • Minimum Window Substring
• Day 9: Sliding Window (4 questions)
  • Sliding Window Maximum
  • Linked List - Reverse Linked List
  • Merge Two Sorted Lists
  • Reorder List
• Day 10: Linked List (4 questions)
  • Remove Nth Node From End of List
  • Copy List with Random Pointer
  • Add Two Numbers
  • Linked List Cycle

Week 3: Trees + Tries

Days 11-15 (20 questions)

• Day 11: Linked List + Trees (4 questions)
  • Find the Duplicate Number
  • LRU Cache
  • Merge k Sorted Lists
  • Reverse Nodes in k-Group
• Day 12: Trees (4 questions)
  • Invert Binary Tree
  • Maximum Depth of Binary Tree
  • Diameter of Binary Tree
  • Balanced Binary Tree
• Day 13: Trees (4 questions)
  • Same Tree
  • Subtree of Another Tree
  • Lowest Common Ancestor of a Binary Search Tree
  • Binary Tree Level Order Traversal
• Day 14: Trees (4 questions)
  • Binary Tree Right Side View
  • Count Good Nodes in Binary Tree
  • Validate Binary Search Tree
  • Kth Smallest Element in a BST
• Day 15: Trees + Tries (4 questions)
  • Construct Binary Tree from Preorder and Inorder Traversal
  • Binary Tree Maximum Path Sum
  • Serialize and Deserialize Binary Tree
  • Implement Trie (Prefix Tree)

Week 4: Tries + Heap/Priority Queue + Backtracking

Days 16-20 (20 questions)

• Day 16: Tries (4 questions)
  • Design Add and Search Words Data Structure
  • Word Search II
  • Heap/Priority Queue - Kth Largest Element in a Stream
  • Last Stone Weight
• Day 17: Heap/Priority Queue (4 questions)
  • K Closest Points to Origin
  • Kth Largest Element in an Array
  • Task Scheduler
  • Design Twitter
• Day 18: Heap/Priority Queue + Backtracking (4 questions)
  • Find Median from Data Stream
  • Backtracking - Subsets
  • Combination Sum
  • Permutations
• Day 19: Backtracking (4 questions)
  • Subsets II
  • Combination Sum II
  • Word Search
  • Palindrome Partitioning
• Day 20: Backtracking + Graphs (4 questions)
  • Letter Combinations of a Phone Number
  • N-Queens
  • Graphs - Number of Islands
  • Clone Graph

Week 5: Graphs + Advanced Dynamic Programming

Days 21-25 (20 questions)

• Day 21: Graphs (4 questions)
  • Max Area of Island
  • Pacific Atlantic Water Flow
  • Surrounded Regions
  • Rotting Oranges
• Day 22: Graphs (4 questions)
  • Walls and Gates
  • Course Schedule
  • Course Schedule II
  • Redundant Connection
• Day 23: Graphs (4 questions)
  • Number of Connected Components in an Undirected Graph
  • Graph Valid Tree
  • Word Ladder
  • 1-D Dynamic Programming - Climbing Stairs
• Day 24: 1-D Dynamic Programming (4 questions)
  • Min Cost Climbing Stairs
  • House Robber
  • House Robber II
  • Longest Palindromic Substring
• Day 25: 1-D Dynamic Programming (4 questions)
  • Palindromic Substrings
  • Decode Ways
  • Coin Change
  • Maximum Product Subarray

Week 6: Dynamic Programming + Intervals

Days 26-30 (20 questions)

• Day 26: 1-D Dynamic Programming (4 questions)
  • Word Break
  • Longest Increasing Subsequence
  • Partition Equal Subset Sum
  • 2-D Dynamic Programming - Unique Paths
• Day 27: 2-D Dynamic Programming (4 questions)
  • Longest Common Subsequence
  • Best Time to Buy and Sell Stock with Cooldown
  • Coin Change 2
  • Target Sum
• Day 28: 2-D Dynamic Programming (4 questions)
  • Interleaving String
  • Longest Increasing Path in a Matrix
  • Distinct Subsequences
  • Edit Distance
• Day 29: 2-D Dynamic Programming + Intervals (4 questions)
  • Burst Balloons
  • Regular Expression Matching
  • Intervals - Insert Interval
  • Merge Intervals
• Day 30: Intervals (4 questions)
  • Non-overlapping Intervals
  • Meeting Rooms
  • Meeting Rooms II
  • Minimum Interval to Include Each Query

Week 7: Greedy + Advanced Algorithms

Days 31-35 (20 questions)

• Day 31: Greedy (4 questions)
  • Maximum Subarray
  • Jump Game
  • Jump Game II
  • Gas Station
• Day 32: Greedy + Advanced Graphs (4 questions)
  • Hand of Straights
  • Merge Triplets to Form Target Triplet
  • Partition Labels
  • Valid Parenthesis String
• Day 33: Advanced Graphs (4 questions)
  • Reconstruct Itinerary
  • Min Cost to Connect All Points
  • Network Delay Time
  • Swim in Rising Water
• Day 34: Advanced Graphs (4 questions)
  • Alien Dictionary
  • Cheapest Flights Within K Stops
  • 1-bit and 2-bit Characters
  • Number of 1 Bits
• Day 35: Bit Manipulation (4 questions)
  • Counting Bits
  • Reverse Bits
  • Missing Number
  • Sum of Two Integers

Week 8: Final Topics + Review

Days 36-40 (10 questions + Review)

• Day 36: Math & Geometry (4 questions)
  • Rotate Image
  • Spiral Matrix
  • Set Matrix Zeroes
  • Happy Number
• Day 37: Math & Geometry (3 questions)
  • Plus One
  • Pow(x, n)
  • Multiply Strings
• Day 38: Review & Practice (Top 10 Most Important)
  • Two Sum
  • Valid Parentheses
  • Merge Two Sorted Lists
  • Maximum Subarray
  • Best Time to Buy and Sell Stock
  • Valid Palindrome
  • Invert Binary Tree
  • Binary Search
  • Longest Substring Without Repeating Characters
  • 3Sum
• Day 39: Review & Practice (Weak Areas)
  • Focus on topics you found most challenging
  • Redo 4-5 difficult problems
• Day 40: Mock Interview Day
  • Simulate interview conditions
  • Practice 2-3 medium problems with time constraints
  • Review patterns and common mistakes

Daily Study Tips

1. Morning: Review previous day's problems (15 minutes)
2. Problem Solving: 1-2 hours for new problems
3. Evening: Code review and note-taking (15 minutes)
4. Track Progress: Mark completed problems and difficulty level
5. Weekend: Optional light review, no new problems

Problem Difficulty Distribution

• Easy: ~30 problems (20%)
• Medium: ~90 problems (60%)
• Hard: ~30 problems (20%)

Success Metrics

• Complete 4 problems per weekday
• Achieve 80%+ first-attempt success rate on Easy problems
• Achieve 60%+ first-attempt success rate on Medium problems
• Achieve 40%+ first-attempt success rate on Hard problems
• Maintain consistent daily practice

Note: This schedule assumes you're familiar with basic programming concepts. Adjust the pace based on your current skill level and time availability.