Striver’s A2Z DSA Sheet – Full 60 Day Plan

Day 1: Basics: Learn I/O, loops, conditionals, and 1D arrays. Solve 5–8 easy problems. Read an
introductory array tutorial.

Day 2: Sorting & Searching: Learn simple sorting algorithms and binary search. Solve 5–7 easy
problems.

Day 3: Recursion I: Learn basics of recursion. Solve 5 easy problems (factorial, Fibonacci, etc.).

Day 4: Recursion II / Backtracking: Solve ~5 problems like subset generation, flood fill.

Day 5: Arrays – Medium / Matrix: Work on sliding-window and prefix-sum techniques. Solve 5
medium problems.

Day 6: Strings I: Learn string basics (reverse, palindrome, frequency counts). Solve 5 easy
problems.

Day 7: Strings II: Solve 5–7 medium string problems (substring search, KMP, etc.).

Day 8: Linked Lists I: Learn singly linked list operations. Solve 5 easy problems.

Day 9: Linked Lists II: Solve 5 medium problems (reverse list, merge two sorted lists).

Day 10: Doubly/Circular Lists: Implement and solve 4–5 problems on doubly/circular linked lists.

Day 11: Stack Basics: Learn stack principles. Solve 5 easy problems (balanced parentheses,
RPN).

Day 12: Queue Basics: Learn queues. Solve 5 easy problems (simulate queue, page replacement).

Day 13: Stacks/Queues – Medium: Solve 5 medium problems (NGE, sliding-window max).

Day 14: Binary Trees – Basics: Study tree traversals. Solve 5 easy problems (preorder, depth).

Day 15: Binary Trees – Advanced: Solve 5 medium problems (views, LCA).

Day 16: Binary Trees – Hard: Solve 3–4 hard problems (diameter, subtree sum, vertical order).

Day 17: BST Concepts: Learn properties of BST. Solve 4 easy problems (insert, search).

Day 18: BST Advanced: Solve 5 medium problems (delete node, validate BST).

Day 19: Graphs – Basics: Study graph representations. Solve 3 easy problems (BFS, components).
Day 20: Graphs – Shortest Paths: Solve 4 medium problems (unweighted shortest path, Dijkstra).

Day 21: Heaps & Priority Queues: Learn heap structure. Solve 4 easy/medium problems.

Day 22: Binary Search Techniques: Practice binary search variants. Solve 4 medium problems.

Day 23: DP – Intro: Learn basics. Solve 3 easy DP problems (climb stairs, Fibonacci).

Day 24: DP – Classic: Solve 5 medium DP problems (knapsack, LIS, LCS).

Day 25: DP – 2D/Complex: Solve 4 hard problems (grid DP, tree DP).

Day 26: Greedy – Basics: Study greedy principles. Solve 3 easy problems (coin change,
scheduling).

Day 27: Greedy – Advanced: Solve 5 medium problems (task assignment, min platforms).

Day 28: Greedy – Hard: Solve 3 hard problems (Dijkstra, Huffman coding).

Day 29: Tries & String Library: Learn Trie. Solve 3 easy problems (insert/search).

Day 30: Segment Trees & BIT: Study segment trees. Solve 3 medium problems. Add 2 bit
manipulation problems.

Day 31: Heaps Deep Dive: Solve 4 medium heap problems (heap sort, sliding window max).

Day 32: Priority Queue Problems: Solve 4 hard problems (k sorted arrays, median in stream).

Day 33: Graph DFS/BFS Practice: Solve 5 medium problems (cycle detection, bipartite check).

Day 34: Graph Shortest Paths: Solve 3 hard graph problems (Dijkstra, Bellman-Ford).

Day 35: Graph MST & Misc: Solve 3 medium problems (MST – Kruskal, Prim).

Day 36: DP – Mixed: Solve 4 medium DP problems (subset sum, partition).

Day 37: DP – Hard: Solve 3 hard problems (knapsack variants, edit distance).

Day 38: Greedy/Interval: Solve 4 medium problems (interval scheduling).

Day 39: Tries Revisited: Solve 3 medium problems (autocomplete, LCP).

Day 40: Segment Tree Advanced: Solve 3 medium problems (range min query, freq range).

Day 41: Mixed DP Review: Solve 3 tough DP problems from earlier topics.
Day 42: Mixed Graph/Tree: Solve 3 problems (tree paths + dp).

Day 43: Sliding Window / Two Pointers: Solve 4 medium array/string problems.

Day 44: Binary Search Variants: Solve 3 medium problems (search in 2D matrix).

Day 45: Bit Manipulation Advanced: Solve 3 medium problems (subset enum, bit tricks).

Day 46: Union-Find: Learn and solve 3 easy problems (cycle detection).

Day 47: Misc Structures: Cover any missed topics. Solve 3 problems.

Day 48: Spaced Review – Mix 1: Solve 5 mixed easy/medium problems.

Day 49: Spaced Review – Mix 2: Solve 5 mixed medium problems (recursion, DP).

Day 50: Spaced Review – Mix 3: Solve 5 hard problems (trees, graphs).

Day 51: New Practice Set: Attempt a set of 5 problems like a mock test.

Day 52: Tries / Advanced Strings: Solve 3 problems (regex match, autocomplete).

Day 53: Segment/Fenwick Tree: Solve 3 problems (range update/query).

Day 54: Complex DP/Graphs: Solve 3 hard problems (graph + dp mix).

Day 55: Review Difficulties: Re-solve previous hard problems.

Day 56: Mock Test 1: Time yourself on 5 new problems (medium-hard).

Day 57: Mock Test 2: Attempt another 5 problems with time limits.

Day 58: Weak Topics Review: Revisit 2–3 weak topics based on mock results.

Day 59: Light Revision: Skim all notes + solve 2–3 light problems.

Day 60: Final Mock: Solve 5 mixed problems (timed) and review solutions.