Skip to main content

DSA Revision Plan

🚀 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

Labels:

Comments

Post a Comment

Share your views on this blog😍😍

Popular posts from this blog

LeetCode 88 Explained: Four Approaches, Mistakes, Fixes & the Final Optimal Python Solution

Evolving My Solution to “Merge Sorted Array” A practical, beginner-friendly walkthrough showing four versions of my code (from a naive approach to the optimal in-place two-pointer solution). Includes explanations, complexity and ready-to-paste code. Problem Summary You are given two sorted arrays: nums1 with size m + n (first m are valid) nums2 with size n Goal: Merge nums2 into nums1 in sorted order in-place . Version 1 — Beginner Approach (Extra List) I merged into a new list then copied back. Works, but not in-place and uses extra memory. class Solution: def merge(self, nums1, m, nums2, n): result = [] p1 = 0 p2 = 0 for _ in range(m+n): if p1 >= m: result.extend(nums2[p2:n]) break elif p2 >= n: result.extend(nums1[p1:m]) break elif nu...
Post a Comment
Read more

Product of Array Except Self in Python | Prefix & Suffix Explained (LeetCode 238)

Problem Overview The Product of Array Except Self is a classic problem that tests your understanding of array traversal and optimization. The task is simple to state but tricky to implement efficiently. Given an integer array nums , you need to return an array such that each element at index i is equal to the product of all the elements in nums except nums[i] . The challenge is that: Division is not allowed The solution must run in O(n) time Initial Thoughts At first glance, it feels natural to compute the total product of the array and divide it by the current element. However, this approach fails because division is forbidden and handling zeroes becomes messy. This pushed me to think differently — instead of excluding the current element, why not multiply everything around it? That’s where the prefix and suffix product pattern comes in. Key Insight: Prefix & Suffix Products For every index i : Prefix product → product of all elements to t...
Post a Comment
Read more

Best Time to Buy and Sell Stock – LeetCode 121

Best Time to Buy and Sell Stock – LeetCode 121 (O(n) One-Pass Solution) The Best Time to Buy and Sell Stock problem from LeetCode 121 is a classic array and greedy problem frequently asked in coding interviews. The goal is to maximize profit by choosing a single day to buy and a later day to sell. Problem Statement You are given an array prices , where prices[i] represents the price of a stock on day i . You may complete at most one transaction (buy once and sell once). Input: prices = [7,1,5,3,6,4] Output: 5 Input: prices = [7,6,4,3,1] Output: 0 If no profit is possible, return 0 . Key Observations You must buy before you sell Only one transaction is allowed The selling day must come after the buying day Approach 1: Brute Force (Not Optimal) The brute force approach checks every possible pair of buying and selling days and calculates the profit. for i in range(n): for j in range(i+1, n): profit = max(profit, prices[j] - prices...
Post a Comment
Read more