PHASE 1: NEETCODE 150 (EASY PROBLEMS ONLY)
━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
Day 1: LEARNING
Hash Tables/Sets Fundamentals
Time/Space Complexity
Array Operations
Two Pointer Technique
PREPARE FOR:
Contains Duplicate: Hash Tables
Valid Anagram: Frequency Counting
Two Sum: Hash Maps
Valid Palindrome: Two Pointers
Day 2: PROBLEMS
NEW PROBLEMS
Contains Duplicate
Valid Anagram
Two Sum
Valid Palindrome
REVIEWS:
Hash Table Operations
Array Traversal Patterns
Two Pointer Implementation
Day 3: LEARNING
Stack Data Structure
Binary Search Theory
Merge Sort Review
Sliding Window Concept
PREPARE FOR:
Best Time Buy/Sell: Sliding Window
Valid Parentheses: Stack
Binary Search: Implementation
Merge Lists: Sorting/Merging
Day 4: PROBLEMS
NEW PROBLEMS
Best Time Buy/Sell Stock
Valid Parentheses
Binary Search
Merge Two Sorted Lists
REVIEWS:
Previous Problems (Day 2)
Stack Operations
Binary Search Patterns
Day 5: LEARNING
Linked List Operations
Binary Tree Fundamentals
Tree Traversal Methods
Height/Depth Concepts
PREPARE FOR:
Linked List Cycle: Floyd's
Tree Problems Implementation
Recursion in Trees
Day 6: PROBLEMS
NEW PROBLEMS
Linked List Cycle
Invert Binary Tree
Maximum Depth Binary Tree
Diameter Binary Tree
REVIEWS:
Day 4 Problems
Linked List Operations
Tree Traversals
Day 7: LEARNING
Tree Balancing Concepts
Subtree Properties
Priority Queue/Heap
Binary Tree Properties
PREPARE FOR:
Balanced Tree Verification
Same Tree Comparison
Subtree Relations
Heap Operations
Day 8: PROBLEMS
NEW PROBLEMS
Balanced Binary Tree
Same Tree
Subtree of Another Tree
Last Stone Weight
REVIEWS:
Day 6 Problems
Tree Patterns
Heap Implementation
Day 9: LEARNING
Heap Operations Advanced
Number Theory Basics
Math Problem Patterns
XOR Operations
PREPARE FOR:
Kth Largest Implementation
Happy Number Logic
Plus One Cases
Single Number XOR
Day 10: PROBLEMS
NEW PROBLEMS
Kth Largest in Stream
Happy Number
Plus One
Single Number
REVIEWS:
Day 8 Problems
Heap Operations
Mathematical Patterns
Day 11: LEARNING
Bit Manipulation Basics
Binary Numbers
Bit Operations
Common Bit Patterns
PREPARE FOR:
Number of 1 Bits
Counting Bits Logic
Reverse Bits Operations
Missing Number Bit Manipulation
Day 12: PROBLEMS
NEW PROBLEMS
Number of 1 Bits
Counting Bits
Reverse Bits
Missing Number
REVIEWS:
Day 10 Problems
Bit Operations
Binary Number Operations
Day 13: LEARNING
Review All Data Structures
Pattern Recognition
Time Complexity Analysis
Interview Strategies
PREPARE FOR:
Mock Interviews
Pattern Applications
Edge Cases
Optimal Solutions
Day 14: FINAL REVIEW
Mock Interview Problems
All 24 Problems Review
Pattern Recognition
Time/Space Optimization
PHASE 2: NEETCODE 150 (ALL 74 MEDIUM PROBLEMS)
━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━
Day 15: LEARNING
Array Manipulation Advanced
Hash Map Techniques
Matrix Operations
PREPARE FOR:
Group Anagrams (Hash Map)
Top K Frequent (Heap)
Product Array (Prefix)
Day 16: PROBLEMS
NEW PROBLEMS
Group Anagrams
Top K Frequent Elements
Product of Array Except Self
REVIEWS:
Missing Number (1d)
Counting Bits (3d)
Valid Palindrome (1w)
Day 17: LEARNING
Matrix Traversal
Sudoku Rules
String Encoding
PREPARE FOR:
Valid Sudoku
Encode/Decode Strings
Longest Consecutive
Day 18: PROBLEMS
NEW PROBLEMS
Valid Sudoku
Encode and Decode Strings
Longest Consecutive Sequence
REVIEWS:
Group Anagrams (1d)
Number of 1 Bits (3d)
Reverse Bits (1w)
Day 19: LEARNING
Two Pointer Advanced
Sliding Window Patterns
Container Properties
PREPARE FOR:
Two Sum II
Three Sum
Container With Water
Day 20: PROBLEMS
NEW PROBLEMS
Two Sum II
Three Sum
Container With Most Water
REVIEWS:
Valid Sudoku (1d)
Top K Frequent (3d)
Missing Number (1w)
Day 21: LEARNING
Sliding Window Advanced
Character Replacement
Permutation Checking
PREPARE FOR:
Longest Substring No Repeat
Longest Repeating Character
Permutation in String
Day 22: PROBLEMS
NEW PROBLEMS
Longest Substring Without Repeating
Longest Repeating Character Replacement
Permutation in String
REVIEWS:
Three Sum (1d)
Encode/Decode (3d)
Product Array (1w)
Day 23: LEARNING
Stack Advanced Patterns
Monotonic Stack
Polish Notation
PREPARE FOR:
Min Stack
Evaluate RPN
Generate Parentheses
Day 24: PROBLEMS
NEW PROBLEMS
Min Stack
Evaluate Reverse Polish
Generate Parentheses
REVIEWS:
Longest Substring (1d)
Two Sum II (3d)
Valid Sudoku (1w)
Day 25: LEARNING
Stack with Temperatures
Car Fleet Concepts
Time Series Pattern
PREPARE FOR:
Daily Temperatures
Car Fleet
Time Based Store
Day 26: PROBLEMS
NEW PROBLEMS
Daily Temperatures
Car Fleet
Time Based Key-Value Store
REVIEWS:
Min Stack (1d)
Permutation in String (3d)
Container With Water (1w)
Day 27: LEARNING
Binary Search Advanced
Rotated Arrays
Matrix Search
PREPARE FOR:
Search in Rotated Array
Find Min in Rotated
Search 2D Matrix
Day 28: PROBLEMS
NEW PROBLEMS
Search in Rotated Array
Find Min in Rotated Array
Search 2D Matrix
REVIEWS:
Daily Temperatures (1d)
Generate Parentheses (3d)
Longest Repeating Char (1w)
Day 29: LEARNING
Binary Search Applications
K-way Distribution
Median Finding
PREPARE FOR:
Koko Eating Bananas
Median Two Arrays
Find Peak Element
Day 30: PROBLEMS
NEW PROBLEMS
Koko Eating Bananas
Find Median of Two Sorted Arrays
Find Peak Element
REVIEWS:
Search Rotated Array (1d)
Car Fleet (3d)
Evaluate RPN (1w)
Day 31: LEARNING
Linked List Advanced
Two Pointer LL
Random Pointer
PREPARE FOR:
Remove Nth Node
Copy List Random Pointer
Add Two Numbers
Day 32: PROBLEMS
NEW PROBLEMS
Remove Nth Node
Copy List with Random Pointer
Add Two Numbers
REVIEWS:
Koko Eating Bananas (1d)
Search 2D Matrix (3d)
Time Based KV Store (1w)
Day 33: LEARNING
Linked List Ordering
Cycle Detection
LRU Cache Design
PREPARE FOR:
Reorder List
Find Duplicate Number
LRU Cache
Day 34: PROBLEMS
NEW PROBLEMS
Reorder List
Find Duplicate Number
LRU Cache
REVIEWS:
Remove Nth Node (1d)
Find Median Arrays (3d)
Find Min Rotated (1w)
Day 35: LEARNING
Tree Traversal Advanced
Level Order Pattern
Right View Technique
PREPARE FOR:
Binary Tree Level Order
Right Side View
Count Good Nodes
Day 36: PROBLEMS
NEW PROBLEMS
Binary Tree Level Order
Binary Tree Right Side View
Count Good Nodes
REVIEWS:
Reorder List (1d)
Add Two Numbers (3d)
Find Peak Element (1w)
Day 37: LEARNING
BST Properties
Tree Validation
Tree Construction
PREPARE FOR:
Validate BST
Kth Smallest BST
Construct from Pre/In
Day 38: PROBLEMS
NEW PROBLEMS
Validate Binary Search Tree
Kth Smallest Element BST
Construct BT from Pre/Inorder
REVIEWS:
Level Order (1d)
Find Duplicate (3d)
Copy List Random (1w)
Day 39: LEARNING
Path Sum Advanced
Max Path Concepts
Tree to Graph
PREPARE FOR:
Path Sum II
Binary Tree Max Path
All Nodes Distance K
Day 40: PROBLEMS
NEW PROBLEMS
Path Sum II
Binary Tree Maximum Path Sum
All Nodes Distance K
REVIEWS:
Validate BST (1d)
Right Side View (3d)
LRU Cache (1w)
Day 41: LEARNING
Trie Data Structure
Word Search Design
Prefix Tree Ops
PREPARE FOR:
Implement Trie
Design Add & Search
Word Search II
Day 42: PROBLEMS
NEW PROBLEMS
Implement Trie
Design Add & Search Words
Word Search II
REVIEWS:
Path Sum II (1d)
Kth Smallest BST (3d)
Count Good Nodes (1w)
Day 43: LEARNING
Heap Advanced Usage
Task Scheduling
Twitter Design
PREPARE FOR:
Task Scheduler
Design Twitter
K Closest Points
Day 44: PROBLEMS
NEW PROBLEMS
Task Scheduler
Design Twitter
K Closest Points to Origin
REVIEWS:
Implement Trie (1d)
Max Path Sum (3d)
Construct BT (1w)
Day 45: LEARNING
Backtracking Fundamentals
Subset Generation
Combination Sum
PREPARE FOR:
Subsets
Combination Sum
Permutations
Day 46: PROBLEMS
NEW PROBLEMS
Subsets
Combination Sum
Permutations
REVIEWS:
Task Scheduler (1d)
Word Search II (3d)
Distance K Nodes (1w)
Day 47: LEARNING
Advanced Backtracking
Subset Variations
Combination Constraints
PREPARE FOR:
Subsets II
Combination Sum II
Word Search
Day 48: PROBLEMS
NEW PROBLEMS
Subsets II
Combination Sum II
Word Search
REVIEWS:
Subsets (1d)
Design Twitter (3d)
Design Add & Search (1w)
Day 49: LEARNING
Phone Letter Combos
Palindrome Partitioning
State Management
PREPARE FOR:
Letter Combinations
Palindrome Partitioning
N-Queens
Day 50: PROBLEMS
NEW PROBLEMS
Letter Combinations of Phone
Palindrome Partitioning
N-Queens
REVIEWS:
Subsets II (1d)
Permutations (3d)
K Closest Points (1w)
Day 51: LEARNING
Graph Fundamentals
Course Scheduling
Island Problems
PREPARE FOR:
Course Schedule
Number of Islands
Clone Graph
Day 52: PROBLEMS
NEW PROBLEMS
Course Schedule
Number of Islands
Clone Graph
REVIEWS:
Letter Combinations (1d)
Word Search (3d)
Combination Sum (1w)
Day 53: LEARNING
Graph BFS/DFS Advanced
Pacific Atlantic Flow
Rotting Oranges
PREPARE FOR:
Pacific Atlantic Water
Rotting Oranges
Walls and Gates
Day 54: PROBLEMS
NEW PROBLEMS
Pacific Atlantic Water Flow
Rotting Oranges
Walls and Gates
REVIEWS:
Course Schedule (1d)
Palindrome Partition (3d)
Combination Sum II (1w)
Day 55: LEARNING
Advanced Graph Concepts
Network Delay
Minimum Spanning Tree
PREPARE FOR:
Network Delay Time
Min Cost Connect Points
Course Schedule II
Day 56: PROBLEMS
NEW PROBLEMS
Network Delay Time
Min Cost to Connect Points
Course Schedule II
REVIEWS:
Pacific Atlantic (1d)
Clone Graph (3d)
N-Queens (1w)
Day 57: LEARNING
1D DP Fundamentals
House Robber Pattern
Subsequence Pattern
PREPARE FOR:
House Robber
House Robber II
Longest Increasing Subseq
Day 58: PROBLEMS
NEW PROBLEMS
House Robber
House Robber II
Longest Increasing Subsequence
REVIEWS:
Network Delay (1d)
Rotting Oranges (3d)
Number of Islands (1w)
Day 59: LEARNING
Palindrome DP
String DP Patterns
Substring vs Subsequence
PREPARE FOR:
Longest Palindromic Substr
Palindromic Substrings
Decode Ways
Day 60: PROBLEMS
NEW PROBLEMS
Longest Palindromic Substring
Palindromic Substrings
Decode Ways
REVIEWS:
House Robber (1d)
Course Schedule II (3d)
Walls and Gates (1w)
Day 61: LEARNING
Coin Change Pattern
Product Array DP
Word Break Logic
PREPARE FOR:
Coin Change
Maximum Product Subarray
Word Break
Day 62: PROBLEMS
NEW PROBLEMS
Coin Change
Maximum Product Subarray
Word Break
REVIEWS:
Palindromic Substr (1d)
House Robber II (3d)
Min Cost Connect (1w)
Day 63: LEARNING
2D DP Concepts
Grid Problems
String Matching
PREPARE FOR:
Unique Paths
Longest Common Subsequence
Target Sum
Day 64: PROBLEMS
NEW PROBLEMS
Unique Paths
Longest Common Subsequence
Target Sum
REVIEWS:
Coin Change (1d)
Decode Ways (3d)
LIS (1w)
Day 65: LEARNING
Greedy Algorithm
Maximum Subarray
Jump Game Logic
PREPARE FOR:
Maximum Subarray
Jump Game
Jump Game II
Day 66: PROBLEMS
NEW PROBLEMS
Maximum Subarray
Jump Game
Jump Game II
REVIEWS:
Unique Paths (1d)
Word Break (3d)
Long Palindrome Substr (1w)
Day 67: LEARNING
Gas Station Pattern
Hand of Straights
Merge Triplets
PREPARE FOR:
Gas Station
Hand of Straights
Merge Triplets
Day 68: PROBLEMS
NEW PROBLEMS
Gas Station
Hand of Straights
Merge Triplets to Form Target
REVIEWS:
Maximum Subarray (1d)
LCS (3d)
Max Product Array (1w)
Day 69: LEARNING
Partition Labels
Final Pattern Review
Interview Strategies
PREPARE FOR:
Partition Labels
Final Medium Problems
Pattern Recognition
Day 70: PROBLEMS
NEW PROBLEMS
Partition Labels
Final Pattern Problems
Complex Problem Review
REVIEWS:
Gas Station (1d)
Jump Game (3d)
Target Sum (1w)
