🚀 2-Week DSA Comeback & Revision Plan
Goal: Regain momentum, strengthen weak areas (Trees, Graphs, Heaps, Intervals), and build DP foundation.
| Day | Focus Area | Problem 1 (Weak Area) | Problem 2 (DP) | Problem 3 (Revision) |
|---|---|---|---|---|
| Day 1 | Trees | Balanced Binary Tree | Climbing Stairs | Valid Palindrome |
| Day 2 | Graphs | Flood Fill | Unique Paths | Two Sum |
| Day 3 | Heaps | Top K Frequent Elements | Minimum Path Sum | Binary Search |
| Day 4 | Intervals | Meeting Rooms | House Robber | Merge Intervals |
| Day 5 | Trees | Diameter of Binary Tree | House Robber II | Max Depth of Binary Tree |
| Day 6 | Graphs | Course Schedule | Triangle | Number of Islands |
| Day 7 | Heaps | Kth Largest Element | Maximum Subarray | K Closest Points |
| Day 8 | Intervals | Insert Interval | Unique Paths II | Non-overlapping Intervals |
| Day 9 | Trees | Level Order Traversal | LIS | Invert Binary Tree |
| Day 10 | Graphs | Rotting Oranges | Coin Change | Clone Graph |
| Day 11 | Heaps | Median Finder | LCS | Top K Frequent |
| Day 12 | Intervals | Meeting Rooms II | Maximal Square | Merge Intervals |
| Day 13 | Mixed | Largest Rectangle | Stock | Longest Substring |
| Day 14 | Final Test | 3Sum | Max Product Path | Min Window Substring |
Daily Rule: Solve 3 problems → 1 weak + 1 DP + 1 revision
Comments
Post a Comment
Share your views on this blog😍😍