30 Day DSA Preparation Plan

Week 1: Foundations

Days 1–2: Arrays—two pointers, sliding window, prefix sum. Days 3–4: Strings and hashing. Days 5–7: Binary search and sorting. Revise arrays.

Week 2: Linear Structures

Days 8–9: Linked list—reversal, cycle, merge. Days 10–11: Stack and queue, monotonic stack. Days 12–14: Recursion and backtracking basics. Revise Week 1.

Week 3: Trees and Graphs

Days 15–17: Binary trees—traversals, LCA, BST. Days 18–20: Graphs—BFS, DFS, topological sort, Dijkstra. Day 21: Revise trees and graphs.

Week 4: DP and Polish

Days 22–24: Dynamic programming—1D, 2D, knapsack, LCS. Days 25–26: Greedy and heap. Mixed practice. Days 27–28: Mock interviews or timed practice. Days 29–30: Revision and weak-spot focus.

Tips

• Solve at least 2–3 problems per day. Revise previous topics every 3–4 days.
• Use Preplume(/) to track daily progress and maintain a timeline.