Personal Study Plan 60 Days · From Zero to Interview-Ready Data Structures & Algorithms

DSA MASTERPLAN

60 Days 8 Weeks 150+ LeetCode Questions Daily Theory + Practice Weekly Revision Built-In
New Topic
Practice Day
Revision Day
Mixed
Rest / Mock Test

How to Use This Plan

Har din pehle theory padh, fir example banao notebook mein, tab questions karo. Har week ke end mein ek revision + mock session hai. Sunday hamesha revision + rest hai — skip mat karo.

Tools You Need

LeetCode account (free chalega), ek notebook for patterns, VS Code ya online compiler. Neetcode.io bhi saath rakh — unke videos most topics pe best hain. Do Revision sessions mein Anki cards use karo.

Daily Schedule

Theory: 45–60 min. Code karo examples khud likho: 30 min. LeetCode: 1.5–2 hrs. Total: ~3 hrs/day. Easy days mein extra question karo. Hard days mein ek question bhi enough hai — understand karo, copy mat karo.

01

Foundation Phase — Weeks 1–4

Days 1–28 · Arrays, Strings, Hashing, Linked Lists, Stack, Queue, Recursion, Trees

Week 01 Arrays & Two Pointers & Sliding Window Days 1–7
01
Arrays Basics + Time Complexity
New Topic
Theory
  • Array declaration, indexing, memory layout
  • Static vs Dynamic arrays (ArrayList concept)
  • Big-O notation: O(1), O(n), O(n²) — visually samjho
  • Space complexity basics
  • Best/Worst/Average case analysis
LeetCode Questions
  • 1. Two Sum Easy
  • 217. Contains Duplicate Easy
  • 242. Valid Anagram Easy
Focus: Brute force pehle likhna seekho. Optimize baad mein.
02
Two Pointers Technique
New Topic
Theory
  • Two pointers kab use karte hain (sorted array)
  • Left-right pointer pattern
  • Fast-slow pointer concept (intro only)
  • In-place manipulation tricks
LeetCode Questions
  • 125. Valid Palindrome Easy
  • 167. Two Sum II (Sorted) Medium
  • 15. 3Sum Medium
  • 11. Container With Most Water Medium
Pattern notebook mein likho: "Left++ when need bigger, right-- when need smaller"
03
Prefix Sum + Kadane's Algorithm
New Topic
Theory
  • Prefix sum array build karna
  • Range sum queries in O(1)
  • Kadane's Algorithm — max subarray sum
  • Prefix sum + HashMap trick
LeetCode Questions
  • 53. Maximum Subarray Medium
  • 303. Range Sum Query Easy
  • 560. Subarray Sum Equals K Medium
Kadane's ko dry-run notebook pe karo 3 different arrays pe — jab tak samjhe nahi.
04
Sliding Window — Fixed + Variable
New Topic
Theory
  • Fixed window size problems
  • Variable window — expand/shrink logic
  • When to use sliding window vs two pointers
  • Window + HashMap pattern
LeetCode Questions
  • 643. Maximum Average Subarray I Easy
  • 3. Longest Substring Without Repeating Medium
  • 424. Longest Repeating Char Replacement Medium
  • 76. Minimum Window Substring Hard
76 is hard — dekh solution agar 30 min mein nahi hua. Pattern samajhna important hai.
05
Array Sorting + Intervals
New Topic
Theory
  • Sort karne ke baad kya milta hai (properties)
  • Merge intervals pattern
  • Meeting rooms problem intuition
  • Product of array except self trick (no division)
LeetCode Questions
  • 56. Merge Intervals Medium
  • 57. Insert Interval Medium
  • 238. Product of Array Except Self Medium
  • 252. Meeting Rooms Easy
06
Practice + Extra Array Problems
Practice Day
Review First
  • Two pointers pattern re-read (5 min)
  • Sliding window template likhna without seeing notes
LeetCode Questions
  • 121. Best Time to Buy & Sell Stock Easy
  • 152. Maximum Product Subarray Medium
  • 153. Find Min in Rotated Sorted Array Medium
  • 33. Search in Rotated Sorted Array Medium
  • 128. Longest Consecutive Sequence Medium
Agar koi question 45 min baad bhi nahi hua — solution dekh, pattern note karo, next day revisit karo.
07
Revision Sunday — Week 1
Revision Day
Revision Checklist
  • Revisit 3 questions you found hardest this week
  • Write all patterns learned in your notebook from memory
  • Re-solve: 3. Longest Substring + 15. 3Sum without hints
  • Watch Neetcode's Array playlist (2–3 videos)
Rest bhi lo — 2 hrs enough hai aaj. Kal fresh start hoga.
Week 02 Strings + Hashing + Binary Search Days 8–14
08
Hashing — HashMap & HashSet
New Topic
Theory
  • Hash function concept, collision handling
  • HashMap vs HashSet — kab kya use karo
  • Frequency counting pattern
  • Complement / pair search pattern
  • Amortized O(1) operations
LeetCode Questions
  • 49. Group Anagrams Medium
  • 347. Top K Frequent Elements Medium
  • 36. Valid Sudoku Medium
  • 271. Encode and Decode Strings Medium
09
String Manipulation Patterns
New Topic
Theory
  • String immutability aur StringBuilder use
  • Character frequency array trick (26 size)
  • Palindrome checks — odd/even length
  • String matching intuition (brute vs KMP concept)
LeetCode Questions
  • 5. Longest Palindromic Substring Medium
  • 647. Palindromic Substrings Medium
  • 20. Valid Parentheses Easy
  • 28. Find the Index of First Occurrence Easy
10
Binary Search — Core + Variants
New Topic
Theory
  • Classic binary search template (lo, hi, mid)
  • Lower bound / upper bound kab use karo
  • Binary search on answer concept (monotonic functions)
  • Off-by-one errors avoid karna — lo <= hi vs lo < hi
LeetCode Questions
  • 704. Binary Search Easy
  • 74. Search a 2D Matrix Medium
  • 875. Koko Eating Bananas Medium
  • 981. Time Based Key-Value Store Medium
Binary search on answer is the most important concept — "kya ye possible hai?" pattern yaad karo.
11
Binary Search — Advanced Applications
Practice Day
LeetCode Questions
  • 153. Find Min in Rotated Sorted Array Medium
  • 33. Search in Rotated Sorted Array Medium
  • 4. Median of Two Sorted Arrays Hard
  • 162. Find Peak Element Medium
Q4 — Median of Two Arrays is classic hard. Puri tarah samjho, ek line bhi confusion nahi chahiye. Ye bahut puchha jaata hai.
12
String + Hashing Mixed Practice
Mixed
LeetCode Questions
  • 438. Find All Anagrams in a String Medium
  • 567. Permutation in String Medium
  • 387. First Unique Character Easy
  • 791. Custom Sort String Medium
  • 179. Largest Number Medium
438 aur 567 same pattern hai — sliding window + char frequency. Ek solve karo dono samajh aayenge.
13
Sorting Algorithms Deep Dive
New Topic
Theory
  • Merge Sort — implement karo (divide & conquer base)
  • Quick Sort — partition logic, pivot choice
  • Counting Sort / Bucket Sort — when to use
  • Why sorting helps: binary search enable, duplicates find
LeetCode Questions
  • 912. Sort an Array Medium (implement merge sort)
  • 75. Sort Colors Medium
  • 148. Sort List Medium
14
Revision Sunday — Weeks 1+2
Revision Day
Revision Checklist
  • Re-solve without hints: Two Sum, 3Sum, Valid Palindrome
  • Binary search template khud se likhna (no looking)
  • Mock: 3 random easy + 2 medium (timer laga ke — 25 min each)
  • Notes review: all patterns written down
Week 03 Linked Lists + Stack + Queue Days 15–21
15
Linked List Fundamentals
New Topic
Theory
  • Singly vs Doubly Linked List structure
  • Node class banana, pointer manipulation
  • Insert/Delete at head, tail, middle — O(1) vs O(n)
  • Dummy node trick — kyun use karte hain
LeetCode Questions
  • 206. Reverse Linked List Easy
  • 21. Merge Two Sorted Lists Easy
  • 143. Reorder List Medium
206 ko iteratively aur recursively dono se karo — dono samajhna zaroori hai.
16
Fast-Slow Pointer (Floyd's Algorithm)
New Topic
Theory
  • Tortoise and Hare algorithm — proof kyun kaam karta hai
  • Cycle detection pattern
  • Finding middle of linked list
  • Finding cycle start node
LeetCode Questions
  • 141. Linked List Cycle Easy
  • 142. Linked List Cycle II Medium
  • 876. Middle of the Linked List Easy
  • 287. Find the Duplicate Number Medium
17
Linked List Advanced Problems
Practice Day
LeetCode Questions
  • 19. Remove Nth Node From End Medium
  • 138. Copy List with Random Pointer Medium
  • 23. Merge K Sorted Lists Hard
  • 25. Reverse Nodes in k-Group Hard
23 use karo heap se (Min-Heap of ListNodes). 25 ek classicinterview question hai — zaroor samjho.
18
Stack — Monotonic Stack
New Topic
Theory
  • Stack LIFO — push, pop, peek operations
  • Monotonic stack kya hai (increasing/decreasing)
  • "Next Greater Element" pattern
  • Stack using array vs linked list
LeetCode Questions
  • 155. Min Stack Medium
  • 496. Next Greater Element I Easy
  • 739. Daily Temperatures Medium
  • 84. Largest Rectangle in Histogram Hard
84 bahut important hai — FAANG mein poocha jaata hai. Monotonic stack approach samjho.
19
Queue + Deque
New Topic
Theory
  • Queue FIFO — enqueue, dequeue
  • Deque (double-ended queue) operations
  • Sliding window maximum using deque
  • Queue using two stacks (classic interview)
  • Circular queue implementation
LeetCode Questions
  • 239. Sliding Window Maximum Hard
  • 232. Implement Queue using Stacks Easy
  • 225. Implement Stack using Queues Easy
  • 622. Design Circular Queue Medium
20
Stack/Queue Mixed Practice
Practice Day
LeetCode Questions
  • 150. Evaluate Reverse Polish Notation Medium
  • 22. Generate Parentheses Medium
  • 853. Car Fleet Medium
  • 901. Online Stock Span Medium
22 actually recursion+backtracking hai — foreshadow next week ka!
21
Revision Sunday — Week 3
Revision Day
Revision Checklist
  • Implement Linked List from scratch (without hints)
  • Re-solve: Reverse LL + Detect Cycle + Daily Temperatures
  • Draw: fast-slow pointer on paper for cycle detection
  • Patterns recap: dummy node, monotonic stack
Week 04 Recursion + Trees (DFS/BFS) Days 22–28
22
Recursion + Backtracking Foundation
New Topic
Theory
  • Call stack visualization — draw it!
  • Base case + recursive case pattern
  • Backtracking: "choose, explore, unchoose"
  • Time complexity of recursion trees
LeetCode Questions
  • 46. Permutations Medium
  • 78. Subsets Medium
  • 39. Combination Sum Medium
  • 40. Combination Sum II Medium
Recursion tree draw karo paper pe for each problem. Ye samajhna future DP ke liye critical hai.
23
Binary Trees — Structure + DFS
New Topic
Theory
  • TreeNode structure, height, depth concepts
  • Inorder, Preorder, Postorder traversal
  • DFS recursive implementation
  • When to use which traversal
LeetCode Questions
  • 226. Invert Binary Tree Easy
  • 104. Maximum Depth of Binary Tree Easy
  • 543. Diameter of Binary Tree Easy
  • 110. Balanced Binary Tree Easy
  • 100. Same Tree Easy
24
Binary Trees — BFS + Level Order
New Topic
Theory
  • BFS using Queue — level order traversal
  • Level-by-level processing pattern
  • Right side view intuition
  • BFS vs DFS — kab kaunsa better
LeetCode Questions
  • 102. Binary Tree Level Order Traversal Medium
  • 199. Binary Tree Right Side View Medium
  • 1448. Count Good Nodes in Binary Tree Medium
  • 112. Path Sum Easy
25
Tree Advanced + Construct Trees
Practice Day
LeetCode Questions
  • 105. Construct BT from Preorder+Inorder Medium
  • 124. Binary Tree Maximum Path Sum Hard
  • 297. Serialize and Deserialize Binary Tree Hard
  • 572. Subtree of Another Tree Easy
124 is very important — "global max variable" trick. Samjho ki har node ek "path" ka part ho sakta hai.
26
Backtracking — Hard Problems
Practice Day
LeetCode Questions
  • 79. Word Search Medium
  • 131. Palindrome Partitioning Medium
  • 51. N-Queens Hard
  • 17. Letter Combinations of a Phone Number Medium
N-Queens ek backtracking masterpiece hai. Solution samjho completely.
27
Phase 1 Comprehensive Practice
Mixed
Timed Mock Session (25 min each)
  • 3 Medium problems from weeks 1–4 (random pick)
  • 1 Hard problem (your choice)
Must-Revisit
  • 76. Minimum Window Substring Hard
  • 84. Largest Rectangle in Histogram Hard
Aaj khud time karo — 25 min per problem. Submit solution aur compare with editorial.
28
Big Revision Sunday — Phase 1 Complete
Revision Day
Full Review
  • Write all patterns: 2-pointer, sliding window, prefix sum, binary search, monotonic stack, BFS template, DFS template
  • Re-solve 5 questions you found hardest in Phase 1
  • Score yourself: how many mediums you solved independently?
4 weeks complete! Aab tum beginner nahi ho. Phase 2 ke liye ready ho — sab kuch build hoga ispe.
02

Intermediate Phase — Weeks 5–8

Days 29–60 · BST, Heaps, Graphs, Dynamic Programming, Advanced Topics, Mock Interviews

Week 05 BST + Heap + Priority Queue Days 29–35
29
Binary Search Tree — Properties
New Topic
Theory
  • BST property: left < root < right (and subtrees)
  • Insert, Search, Delete — O(log n) average
  • Inorder traversal gives sorted output — why?
  • Balanced vs Unbalanced BST — worst case O(n)
LeetCode Questions
  • 700. Search in a BST Easy
  • 701. Insert into a BST Medium
  • 450. Delete Node in a BST Medium
  • 98. Validate Binary Search Tree Medium
30
BST — Kth Smallest, LCA, Successor
Practice Day
LeetCode Questions
  • 230. Kth Smallest Element in BST Medium
  • 235. LCA of Binary Search Tree Medium
  • 236. LCA of Binary Tree Medium
  • 538. Convert BST to Greater Tree Medium
  • 285. Inorder Successor in BST Medium
LCA is asked everywhere. BST version aur regular binary tree version dono samjho — different approaches hain.
31
Heap / Priority Queue
New Topic
Theory
  • Min-Heap vs Max-Heap — heap property
  • Heapify, insert, extract-min — O(log n)
  • Python: heapq module, Java: PriorityQueue
  • "Top K" pattern — always think heap
  • Two heaps pattern (median finder)
LeetCode Questions
  • 703. Kth Largest Element in Stream Easy
  • 1046. Last Stone Weight Easy
  • 973. K Closest Points to Origin Medium
  • 215. Kth Largest Element in Array Medium
32
Heap Advanced — Two Heaps + Merge K
Practice Day
LeetCode Questions
  • 295. Find Median from Data Stream Hard
  • 355. Design Twitter Medium
  • 621. Task Scheduler Medium
  • 778. Swim in Rising Water Hard
295 is the classic two-heaps problem. Ek max-heap left mein, ek min-heap right mein — concept crystal clear hona chahiye.
33
Trie (Prefix Tree)
New Topic
Theory
  • Trie node structure (children array / hashmap)
  • Insert and Search operations
  • Prefix search — startsWith
  • When to use Trie vs HashMap
LeetCode Questions
  • 208. Implement Trie Medium
  • 211. Design Add and Search Words Medium
  • 212. Word Search II Hard
34
Mixed Week 5 Practice
Mixed
LeetCode Questions
  • 23. Merge K Sorted Lists Hard (revisit with heap)
  • 502. IPO Hard
  • 1167. Minimum Cost to Connect Sticks Medium
  • 767. Reorganize String Medium
35
Revision Sunday — Week 5
Revision Day
Revision Checklist
  • Implement MinHeap from scratch using array
  • Re-solve: Find Median from Data Stream (without hints)
  • LCA both versions revisit
  • Trie implement karo without looking at code
Week 06 Graphs — BFS, DFS, Shortest Path, Union Find Days 36–42
36
Graph Fundamentals + Representation
New Topic
Theory
  • Directed vs Undirected graphs
  • Adjacency List vs Adjacency Matrix — tradeoffs
  • Weighted vs Unweighted edges
  • Visited array — cycle prevention
  • Graph DFS template (iterative + recursive)
LeetCode Questions
  • 200. Number of Islands Medium
  • 695. Max Area of Island Medium
  • 133. Clone Graph Medium
  • 417. Pacific Atlantic Water Flow Medium
37
Graph BFS + Shortest Path (Unweighted)
New Topic
Theory
  • BFS guarantees shortest path in unweighted graphs — why?
  • Multi-source BFS pattern
  • BFS on grid (4-directional, 8-directional)
  • Distance tracking with BFS
LeetCode Questions
  • 994. Rotting Oranges Medium
  • 286. Walls and Gates Medium
  • 127. Word Ladder Hard
  • 1091. Shortest Path in Binary Matrix Medium
38
Cycle Detection + Topological Sort
New Topic
Theory
  • Cycle detection in directed graph (DFS + colors)
  • Topological Sort — Kahn's Algorithm (BFS)
  • Topological Sort — DFS postorder
  • When is topological sort possible? (DAG only)
LeetCode Questions
  • 207. Course Schedule Medium
  • 210. Course Schedule II Medium
  • 269. Alien Dictionary Hard
  • 444. Sequence Reconstruction Medium
Course Schedule I aur II bilkul same pattern. 207 solve karo pehle, 210 naturally aayega.
39
Union-Find (Disjoint Set Union)
New Topic
Theory
  • Union-Find structure: parent + rank arrays
  • Find with path compression
  • Union by rank
  • Connected components using DSU
  • Cycle detection with DSU
LeetCode Questions
  • 684. Redundant Connection Medium
  • 323. Number of Connected Components Medium
  • 261. Graph Valid Tree Medium
  • 1202. Smallest String With Swaps Medium
40
Dijkstra + Shortest Path Weighted
New Topic
Theory
  • Dijkstra's algorithm — greedy + min-heap
  • dist[] array initialization (infinity)
  • Why negative edges break Dijkstra
  • Bellman-Ford for negative weights (concept only)
LeetCode Questions
  • 743. Network Delay Time Medium
  • 1631. Path With Minimum Effort Medium
  • 787. Cheapest Flights Within K Stops Medium
41
Minimum Spanning Tree (Prim's + Kruskal's)
New Topic
Theory
  • MST definition — minimum total edge weight
  • Kruskal's — sort edges + DSU
  • Prim's — greedy min-heap approach
LeetCode Questions
  • 1584. Min Cost to Connect All Points Medium
  • 1135. Connecting Cities with Minimum Cost Medium
MST kam poocha jaata hai but concept important hai. Ek din kafi hai ispe.
42
Revision Sunday — Graphs Complete
Revision Day
Revision Checklist
  • Write BFS template, DFS template, Dijkstra template from memory
  • Re-solve: Number of Islands + Course Schedule + Network Delay Time
  • DSU implement karo bina dekhe
  • Topo sort dono approaches
Week 07 Dynamic Programming — Memoization to Tabulation Days 43–49
43
DP Foundation — 1D Problems
New Topic
Theory
  • Overlapping subproblems + optimal substructure
  • Top-down (memoization) vs Bottom-up (tabulation)
  • State definition — "dp[i] means..."
  • Recurrence relation likhna
  • Base cases carefully define karna
LeetCode Questions
  • 70. Climbing Stairs Easy
  • 746. Min Cost Climbing Stairs Easy
  • 198. House Robber Medium
  • 213. House Robber II Medium
Climbing Stairs = Fibonacci. Recursion tree draw karo, memoize karo, phir tabulate karo — teen steps.
44
DP — Subsequences + LCS/LIS
New Topic
Theory
  • Longest Increasing Subsequence — O(n²) DP
  • LIS — O(n log n) using patience sorting
  • Longest Common Subsequence — 2D DP
  • Edit Distance concept
LeetCode Questions
  • 300. Longest Increasing Subsequence Medium
  • 1143. Longest Common Subsequence Medium
  • 72. Edit Distance Medium
  • 1035. Uncrossed Lines Medium
45
DP — 0/1 Knapsack Pattern
New Topic
Theory
  • 0/1 Knapsack — include or exclude each item
  • dp[i][w] definition
  • Space optimization to 1D array
  • Subset sum as knapsack variant
LeetCode Questions
  • 416. Partition Equal Subset Sum Medium
  • 494. Target Sum Medium
  • 474. Ones and Zeroes Medium
416 first samjho — subset sum = knapsack. Ye pattern bahut jagah aata hai.
46
DP — Unbounded Knapsack + Coin Change
Practice Day
Theory
  • Unbounded knapsack — item reuse allowed
  • Inner loop direction flip se reuse enable hota hai
LeetCode Questions
  • 322. Coin Change Medium
  • 518. Coin Change II Medium
  • 377. Combination Sum IV Medium
  • 139. Word Break Medium
47
DP — 2D Grid + Matrix Chain
New Topic
LeetCode Questions
  • 62. Unique Paths Medium
  • 63. Unique Paths II Medium
  • 64. Minimum Path Sum Medium
  • 329. Longest Increasing Path in a Matrix Hard
  • 312. Burst Balloons Hard
312 Burst Balloons is interval DP — ek classic. Samjho kyun dp[i][j] = max coins from bursting all balloons between i and j.
48
DP — String + Palindrome DP
Practice Day
LeetCode Questions
  • 516. Longest Palindromic Subsequence Medium
  • 1312. Minimum Insertions for Palindrome Hard
  • 115. Distinct Subsequences Hard
  • 10. Regular Expression Matching Hard
10 Regular Expr Matching is a top-tier hard. Don't skip — understand the state transitions carefully.
49
Revision Sunday — DP Week
Revision Day
Revision Checklist
  • Re-solve Coin Change + LCS + Partition Equal Subset Sum
  • Write all DP templates: 1D, 2D grid, knapsack
  • Identify: which pattern applies — sequence / grid / knapsack / palindrome
DP is the hardest topic — ek week mein master nahi hoga, but foundations clear honge. Real mastery practice se aati hai.
Week 08 Advanced Topics + Mock Interviews + Final Review Days 50–60
50
Greedy Algorithms
New Topic
Theory
  • Greedy choice property — local optimal = global optimal kab?
  • Exchange argument — proof greedy works
  • Activity selection pattern
  • Interval scheduling greedy
LeetCode Questions
  • 55. Jump Game Medium
  • 45. Jump Game II Medium
  • 134. Gas Station Medium
  • 846. Hand of Straights Medium
  • 1899. Merge Triplets to Form Target Medium
51
Bit Manipulation
New Topic
Theory
  • AND, OR, XOR, NOT, Shift operators
  • XOR tricks: a^a=0, a^0=a
  • Check bit, set bit, clear bit
  • Brian Kernighan's bit count trick
  • Power of 2 check: n & (n-1) == 0
LeetCode Questions
  • 136. Single Number Easy
  • 191. Number of 1 Bits Easy
  • 338. Counting Bits Easy
  • 190. Reverse Bits Easy
  • 371. Sum of Two Integers (no + operator) Medium
52
Math + Number Theory Patterns
New Topic
Theory
  • GCD using Euclidean algorithm
  • Sieve of Eratosthenes — prime list efficiently
  • Modular arithmetic (mod 10^9+7)
  • Fast power (binary exponentiation)
LeetCode Questions
  • 204. Count Primes Medium
  • 202. Happy Number Easy
  • 50. Pow(x, n) Medium
  • 43. Multiply Strings Medium
53
Hard Practice Day — Top Interview Questions
Practice Day
LeetCode Questions
  • 41. First Missing Positive Hard
  • 42. Trapping Rain Water Hard
  • 32. Longest Valid Parentheses Hard
  • 295. Find Median from Data Stream Hard (re-solve)
42. Trapping Rain Water — do it with two pointers AND with monotonic stack AND with DP. Teeno approaches samjho.
54
Mock Interview #1 — Timed
Mock Test
Format
  • Timer: 45 minutes total
  • Pick 2 unseen problems: 1 Medium + 1 Hard
  • Talk out loud while solving (practice explaining)
  • After: review solution, note what you missed
Suggested Picks
  • 438. Find All Anagrams (if not done) Medium
  • Or: LeetCode Weekly Contest problems
55
Segment Trees + Advanced DS (Concept)
New Topic
Theory
  • Segment Tree — range query + point update
  • Build in O(n), query/update in O(log n)
  • Fenwick Tree (BIT) — simpler for prefix sums
  • When to use which
LeetCode Questions
  • 307. Range Sum Query — Mutable Medium
  • 315. Count of Smaller Numbers After Self Hard
Advanced DS — zyada deep mat jao abhi. Concept samjho, ek problem solve karo. Enough hai interview ke liye.
56
Revision Sunday — All Patterns
Revision Day
Grand Revision
  • Write all pattern templates in one notebook page
  • Go through your "patterns" notebook — all 7 weeks
  • Make a list of top 20 problems you want to redo
57
Top 10 Revisit — Array + String + DP
Revision Day
Must-Revisit (from your weak areas)
  • 76. Minimum Window Substring Hard
  • 124. Binary Tree Max Path Sum Hard
  • 42. Trapping Rain Water Hard
  • 300. Longest Increasing Subsequence Medium
  • 207. Course Schedule Medium
Ye sab problems baar baar poocha jaata hai. Clean code likho, edge cases handle karo.
58
Mock Interview #2 — Full Simulation
Mock Test
Format
  • 45 minute timer, no hints, no Google
  • 1 Easy warm-up (5 min), 1 Medium (20 min), 1 Medium/Hard (20 min)
  • Explain your approach before coding
  • After: review all 3, note edge cases you missed
Pramp ya Interviewing.io use karo peer mock interview ke liye — real practice sab se acha hai.
59
Final Weak Areas Day
Mixed
Your Weak Areas
  • Identify 3–5 topics you still feel uncertain about
  • Solve 1–2 fresh problems from each weak area
  • Re-read theory for those topics one more time
This is personalized day. Jis topic mein confidence kam lag raha hai — wahan jao aaj.
60
Day 60 — Final Mock + Celebrate
Mock Test
Final Assessment
  • 3 problems, 45 min, timed — treat it as real interview
  • Count: how many mediums can you solve in 25 min?
  • Write: what patterns do you know cold?
  • Rest. You earned it. 60 days consistent = interview ready.
60 din ho gaye. Shuru kiya tha beginner ke roop mein. Aaj tum ek alag level pe ho. Ab leetcode contest participate karo.

Daily Routine

When Stuck

Resources

Mindset Rules

DSA MASTERPLAN · 60 DAYS · BUILT FOR FOCUSED PREPARATION · ALL QUESTIONS FROM LEETCODE