Roadmap
Uploaded by
prasannk2003Roadmap
Uploaded by
prasannk2003🗓 8-Week Detailed Roadmap
Week 1 (Sorting & Arrays)
Goal:
● FinishStep 2 (Sorting)completely (only 1 problemleft in Lec 2).
● Rapidly close outStep 3 (Arrays)(14 remaining total).
Day 1 (Mon):
● Step 2 – Lec 2 (Sorting-II): 1 remaining
○ Identify that one unsolved Sorting-II problem (e.g., Quick-select variation or
advanced merge sort).
○ Code + debug under 60 min.
● Step 3 – Lec 1 (Arrays Easy): 2 remaining
○ Solve the two easy Array problems you haven’t done. Aim for ≤ 20 min each.
○ Review patterns: prefix sum, two-pointer basics.
Day 2 (Tue):
● Step 3 – Lec 2 (Arrays Medium): 3 remaining
○ C
hoose 3 medium problems (e.g., “Three Sum Variant,” “Container With Most
Water,” “Product Except Self”).
○ Time-box 35 min/problem.
● Step 3 – Lec 3 (Arrays Hard): 7 remaining
○ Pick 2 hard (e.g., “Trapping Rain Water,” “Max Subarray Circular”).
○ Spend ≤ 60 min each (pseudocode → code → test).
Day 3 (Wed):
● Step 3 – Lec 2 (Arrays Medium): finish all (0 remaining)
○ C
omplete remaining 0 → so skip: you already had 11/14 done, now 3 done on
Day 2 (total 14/14).
● Step 3 – Lec 3 (Arrays Hard): finish 3 more (4 remaining)
○ S
olve 3 additional hard: “Subarray with given XOR,” “Sliding-window max
subarray sum,” “Dutch National Flag.”
○ 45–60 min each.
Day 4 (Thu):
● Step 3 – Lec 3 (Arrays Hard): finish remaining 4 (0 remaining)
○ T
ackle the last 4 hard Array problems: “Minimum Window Subarray,” “Merge
Intervals variant,” “Longest Consecutive Sequence,” “Rotate Array in O(1)
space.”
○ Strict timing: 45 min each.
● Step 4 – Lec 1 (BS on 1D Arrays): 1 remaining
○ S
olve the one leftover 1D-binary search problem (e.g., “Find Peak Index in a
Mountain Array”).
○ Review lower_bound/upper_bound edge cases.
Day 5 (Fri):
● Step 4 – Lec 1 (BS on 1D Arrays): finish (0 remaining)
○ If there was any bug from yesterday, fix & test thoroughly.
● Step 4 – Lec 2 (BS on Answers): 6 remaining
○ Split into:
1. 3
medium(e.g., “Split Array Largest Sum,” “Capacityto Ship in D
Days,” “Aggressive Cows”).
2. 3
hard(e.g., “Painters Partition,” “Book Allocation,” “Kth Smallest
Prime Fraction”).
○ Time-box: ≤ 45 min (medium), ≤ 60 min (hard).
Weekend Revision
● Sat (2–3 hours):
1. Mini-mock (2 hours):4 problems disciplined mix:
■ 1
Sorting (medium), 1 Array (hard), 1 Binary Search (1D medium), 1
Array (medium).
■ Simulate interview environment: no editor autocomplete, no notes.
2. Review (30 min):Log mistakes.
● Sun (2–3 hours):
1. C
atch-Up:Any leftover Step 4 Lec 2 problems (if 6yesterday, subtract
however many done).
2. P
review Next Week:Read up onBS on 2D Arrays (Step4 Lec 3)andStep
5 (Strings).
Week 2 (Binary Search (2D & Answers) + Strings)
Goal:
● F
inishStep 4 – Lec 2(up to 0/14) andLec 3 (BS on2D Arrays)(5
remaining).
● FinishStep 5 (Strings): 5 remaining total (2 easy,3 medium).
Day 1 (Mon):
● Step 4 – Lec 2 (BS on Answers): finish remaining (0 remaining)
○ If any leftover from Week 1, finish today.
● Step 4 – Lec 3 (BS on 2D Arrays): 5 remaining
○ S
olve 3 medium 2D-BS problems: “Search a 2D Matrix I,” “Search a 2D
Matrix II,” “Find Kth Smallest Element in a Sorted Matrix.”
○ ≤ 45 min each.
Day 2 (Tue):
● Step 4 – Lec 3 (BS on 2D Arrays): finish remaining 2 (0 remaining)
○ T
ackle 2 hard: “Median of Two Sorted Matrices,” “Smallest Number in M
Sorted Lists (2D Binary Search variant).”
○ ≤ 60 min each.
● Step 5 – Lec 1 (Strings Basic/Easy): 2 remaining
○ Solve 2 easy: “Valid Anagram,” “Implement strStr() (Trivial version).”
○ Review two-pointer string scans.
Day 3 (Wed):
● Step 5 – Lec 2 (Strings Medium): 3 remaining
○ Solve 2 medium: “Longest Palindromic Substring,” “Count and Say.”
○ S
olve 1 medium: “Length of Longest Substring Without Repeating
Characters.”
○ Time-box: ≤ 45 min each.
● Step 6 – Lec 1 (Learn 1D LinkedList): 1 remaining
○ C
omplete the one leftover basic LinkedList concept (e.g., “Reverse Linked
List Recursively”).
○ ≤ 30 min.
Day 4 (Thu):
● Step 6 – Lec 2 (Learn Doubly LinkedList): 4 remaining
○ S
olve 4 easy Doubly-LL problems: “Insert at head/tail,” “Delete node,”
“Reverse DLL,” “Convert Tree to DLL.”
○ ≤ 35 min each.
● Step 6 – Lec 3 (LL Medium Problems): 5 remaining
○ S
olve 5 medium: “Add Two Numbers (LL),” “Odd Even LinkedList,” “Remove
Nth Node from End,” “Copy List with Random Pointer,” “Merge Two Sorted
Lists.”
○ ≤ 45 min each.
Day 5 (Fri):
● Step 6 – Lec 3 (LL Medium): finish remaining (0 remaining)
○ If any one slipped, wrap up.
● Step 6 – Lec 4 (DLL Medium Problems): 3 remaining
○ S
olve 3 medium: “Flatten Multilevel DLL,” “LRU Cache (medium),” “DLL +
Random Pointer Copy.”
○ ≤ 50 min each.
● Step 6 – Lec 5 (LL Hard Problems): 4 remaining
○ Solve 2 hard today: “Merge k Sorted Lists,” “Reverse Nodes in k-Group.”
○ ≤ 60 min each.
Weekend Revision
● Sat (2–3 hours):
1. M
ini-mock (2 hours):4 problems: 1 BS 2D (hard), 1String (medium), 1
LinkedList (hard), 1 random from Arrays.
2. Review (30 min):Log mistakes.
● Sun (2–3 hours):
1. C
atch-Up:Step 6 Lec 5: finish remaining 2 hard LLproblems (“LRU Cache” if
not done, and “Split LinkedList in halves”).
2. P
review Next Week:ReadRecursion (Step 7)andBit Manipulation (Step
8).
Week 3 (Recursion + Bit Manipulation)
Goal:
● C
ompleteStep 7 (Recursion): 11 remaining total (4hard, 0
easy/medium since Lec 2 mostly done).
● BeginStep 8 (Bit Manipulation): 18 remaining.
Day 1 (Mon):
● Step 7 – Lec 1 (Get a Strong Hold): 4 remaining
○ S
olve 4 easy recursion basics: “Factorial variants,” “Sum of digits,” “Fibonacci
with memo,” “Subset generation.”
○ ≤ 30 min each.
● Step 7 – Lec 2 (Subsequences Pattern): finish (0 remaining)
○ You had 11/12; do that 1 left: “Word Break I (simple recursive).”
○ ≤ 40 min.
Day 2 (Tue):
● Step 7 – Lec 3 (Combos/Hard): 6 remaining
○ Solve 2 hard: “N-Queens,” “Sudoku Solver.”
○ ≤ 60 min each (write backtracking tree first).
● Step 7 – Lec 3 (Combos/Hard): 4 remaining
○ Solve 2 more hard: “Combination Sum II/III,” “Palindrome Partitioning.”
○ ≤ 60 min each.
Day 3 (Wed):
● Step 7 – Lec 3 (Combos/Hard): finish remaining 4 (0 remaining)
○ S
olve final 4 hard: “Word Search,” “Generate Parentheses,” “Permutations II,”
“Letter Combinations of a Phone Number.”
○ ≤ 60 min each.
● Step 8 – Lec 1 (Learn Bit Manipulation): 8 remaining
○ Solve 4 easy: “Check kth bit,” “Count set bits,” “Power of two,” “Reverse bits.”
○ ≤ 30 min each.
Day 4 (Thu):
● Step 8 – Lec 1 (Learn Bit Manip): finish remaining 4 (0 remaining)
○ S
olve “Swap two numbers using XOR,” “Divide without / operator,” “Isolate
rightmost set bit,” “Gray code generation.”
○ ≤ 30 min each.
● Step 8 – Lec 2 (Interview Problems): 5 remaining
○ S
olve 3 medium: “Single Number I/II,” “Sum of two numbers without +,”
“Count subarrays with XOR = K.”
○ ≤ 45 min each.
Day 5 (Fri):
● Step 8 – Lec 2 (Interview Problems): finish remaining (0 remaining)
○ Solve “Single Number III,” “Maximum XOR of two numbers in an array.”
○ ≤ 60 min each.
● Step 8 – Lec 3 (Advanced Maths): 5 remaining
○ S
olve 3 medium: “XOR basis for arrays,” “Bit DP subset convolution (easy
variant),” “Power set counting with bits.”
○ ≤ 45 min each.
Weekend Revision
● Sat (2–3 hours):
1. M
ini-mock (2 hours):4 mixed: 1 Recursion (hard),1 Bit Manip (medium), 1
LinkedList (medium), 1 Stack (easy).
2. Review (30 min):Log mistakes.
● Sun (2–3 hours):
1. Finish Step 8 – Lec 3 (Advanced Maths): remaining 2 (0 remaining)
■ S
olve: “Count set bits for all numbers [0…n],” “Count pairs with given
XOR.”
■ ≤ 45 min each.
2. P
review Next Week:ReadStep 9 (Stack & Queues)andStep 10 (Sliding
Window & Two Pointers).
eek 4 (Stack & Queues + Sliding Window & Two
W
Pointers)
Goal:
● FinishStep 9 (Stack & Queues): 26 remaining.
● FinishStep 10 (Sliding Window & Two Pointers): 8remaining.
Day 1 (Mon):
● Step 9 – Lec 1 (Learning): 7 remaining
○ S
olve 5 easy: “Implement Stack class,” “Implement Queue class,” “Min
Stack,” “Evaluate Reverse Polish Notation,” “Valid Parentheses (stack).”
○ ≤ 30 min each.
○ Solve 2 medium: “Daily Temperatures,” “Next Greater Element I.”
○ ≤ 45 min each.
Day 2 (Tue):
● Step 9 – Lec 2 (Prefix/Infix/Postfix): 6 remaining
○ S
olve 3 medium: “Infix → Postfix conversion,” “Evaluate Infix Expression,”
“Convert Postfix → Infix.”
○ ≤ 45 min each.
○ S
olve 3 medium: “Next Greater Element II,” “Largest Rectangle in Histogram
(stack approach),” “Trapping Rain Water (stack).”
○ ≤ 60 min each.
Day 3 (Wed):
● Step 9 – Lec 3 (Monotonic Stack/Queue): 8 remaining
○ S
olve 4 medium: “Sliding Window Maximum,” “Next Smaller Element,”
“Maximal Rectangle,” “Largest Rectangle in Histogram (another variant).”
○ ≤ 45 min each.
○ S
olve 4 hard: “Maximal Rectangle in binary matrix,” “Minimum Remove to
Make Valid Parentheses,” “Shortest Subarray with Sum at Least K,” “Hard
pattern: “Daily Temperatures optimized variant.”
○ ≤ 60 min each.
Day 4 (Thu):
● Step 9 – Lec 4 (Implementation Problems): 5 remaining
○ Solve 3 medium: “Implement Deque,” “LRU Cache,” “Implement Min Queue.”
○ ≤ 45 min each.
○ Solve 2 hard: “Design Hit Counter,” “All O(1) Data Structure.”
○ ≤ 60 min each.
● Step 10 – Lec 1 (Sliding Window & Two Pointers – Medium): 4 remaining
○ S
olve: “Longest Substring Without Repeating Characters” (should already be
done, but re-confirm), “3-Sum,” “Container With Most Water,” “Count
Subarrays with Sum Exactly K.”
○ ≤ 45 min each.
Day 5 (Fri):
● Step 10 – Lec 2 (Sliding Window & Two Pointers – Hard): 4 remaining
○ S
olve “Minimum Window Substring,” “Subarray with K Distinct Integers,”
“Count of Subarrays with Given XOR,” “Split Array Largest Sum (two-pointer
variant).”
○ ≤ 60 min each.
● Finish any leftover from Step 9 or Step 10 (should be 0 remaining).
Weekend Revision
● Sat (2–3 hours):
1. M
ini-mock (2 hours):4 problems: 1 Stack (medium),1 Queue (hard), 1
Sliding Window (hard), 1 random from LinkedList.
2. Review (30 min):Log mistakes.
● Sun (2–3 hours):
1. Catch-Up:If any of Step 9/10 is still pending, finishit today.
2. Preview Next Week:ReadStep 11 (Heaps)andStep 12(Greedy).
Week 5 (Heaps + Greedy)
Goal:
● CompleteStep 11 (Heaps): 17 remaining.
● CompleteStep 12 (Greedy): 7 remaining.
Day 1 (Mon):
● Step 11 – Lec 1 (Learning): 4 remaining
○ S
olve 4 easy: “Implement Min-Heap,” “Implement Max-Heap,” “Find Kth
Largest Element,” “Merge K Sorted Lists.”
○ ≤ 30 min each.
● Step 11 – Lec 2 (Medium): 7 remaining
○ S
olve 4 medium: “Top K Frequent Elements,” “Sliding Window Median,”
“Connect Ropes with Min Cost,” “Task Scheduler (simplified).”
○ ≤ 45 min each.
Day 2 (Tue):
● Step 11 – Lec 2 (Medium): finish 3 remaining (0 remaining)
○ R
emaining: “Find Median from Data Stream (design),” “Rearrange String K
Distance Apart,” “Super Ugly Number.”
○ ≤ 60 min each (treat as medium/hard hybrid).
● Step 11 – Lec 3 (Hard): 6 remaining
○ S
olve 3 hard: “Merge K Sorted Lists (advanced variant),” “Design Twitter
(feed using heaps),” “Task Scheduler with cooldown (full).”
○ ≤ 60 min each.
Day 3 (Wed):
● Step 11 – Lec 3 (Hard): finish 3 remaining (0 remaining)
○ S
olve “Find Median from Data Stream (optimized),” “Rearrange String (hard
variant),” “Super Ugly Number (hard variant).”
○ ≤ 60 min each.
● Step 12 – Lec 1 (Greedy Easy): 1 remaining
○ Solve “Gas Station” or “Jump Game I,” whichever is left.
○ ≤ 30 min.
Day 4 (Thu):
● Step 12 – Lec 2 (Greedy Medium/Hard): 7 remaining
○ S
olve 3 medium: “Partition Labels,” “Fractional Knapsack,” “Lemonade
Change.”
○ ≤ 45 min each.
○ S
olve 4 hard: “Russian Doll Envelopes,” “Rearrange String K Distance Apart
(if not done),” “Candy Distribution,” “Split Array Largest Sum (if not already in
BS).”
○ ≤ 60 min each.
Day 5 (Fri):
● Step 12 – Lec 2 (Greedy Medium/Hard): finish all (0 remaining)
○ Wrap up any stragglers.
● Q
uick Review:Run through all Greedy templates (activityselection, interval
scheduling, “take local optimum” proof sketch).
Weekend Revision
● Sat (2–3 hours):
1. M
ini-mock (2 hours):4 problems: 1 Heap (medium),1 Heap (hard), 1
Greedy (medium), 1 Greedy (hard).
2. Review (30 min):Log mistakes.
● Sun (2–3 hours):
1. Catch-Up:If any leftover from Step 11 or Step 12,finish today.
2. Preview Next Week:ReadStep 13 (Binary Trees) & Step14 (BST).
Week 6 (Binary Trees & BST)
Goal:
● CompleteStep 13 (Binary Trees): 21 remaining.
● CompleteStep 14 (BST): 5 remaining.
Day 1 (Mon):
● Step 13 – Lec 1 (Traversals): 3 remaining
○ Solve 3 easy: “Preorder,” “Inorder,” “Postorder,” “Level Order Zigzag” variants.
○ ≤ 30 min each.
● Step 13 – Lec 2 (Binary Tree Medium Problems): 5 remaining
○ Solve 3 medium: “Validate BST,” “Symmetric Tree,” “Max Depth.”
○ Solve 2 medium: “Path Sum II,” “Populating Next Right Pointers.”
○ ≤ 45 min each.
Day 2 (Tue):
● Step 13 – Lec 2 (Medium): finish remaining (0 remaining)
○ If any straggler, wrap up today.
● Step 13 – Lec 3 (Hard): 13 remaining
○ S
olve 4 hard: “Binary Tree Maximum Path Sum,” “Serialize/Deserialize BT,”
“Sum of Distances in Tree,” “Tree Diameter.”
○ ≤ 60 min each.
Day 3 (Wed):
● Step 13 – Lec 3 (Hard): 9 remaining
○ S
olve 4 hard: “House Robber III (Tree DP),” “Recover Binary Search Tree,”
“Binary Tree Cameras,” “Binary Tree Right Side View (advanced).”
○ ≤ 60 min each.
● Step 14 – Lec 1 (BST Concepts): finish (0 remaining)
○ Quick recap: insertion, deletion, inorder property.
Day 4 (Thu):
● Step 14 – Lec 2 (BST Practice Problems): 8 remaining
○ S
olve 4 medium: “Insert into BST,” “Search in BST,” “Kth Smallest in BST,”
“Lowest Common Ancestor (BST).”
○ ≤ 45 min each.
○ Solve 2 hard: “Convert Sorted Array to BST,” “Convert BST to Greater Tree.”
○ ≤ 60 min each.
Day 5 (Fri):
● Step 14 – Lec 2 (BST Practice): finish remaining (0 remaining)
○ Solve “Serialize/Deserialize BST (variant),” “Trim a Binary Search Tree.”
○ ≤ 60 min each.
● Step 13 – Lec 3 (Binary Tree Hard): finish remaining (0 remaining)
○ S
olve final 3 hard: “Binary Tree Maximum Path Sum (if not done),” “Sum of
Distances in Tree (if not done),” “Hard variant of ‘Binary Tree Cameras’.”
○ ≤ 60 min each.
Weekend Revision
● Sat (2–3 hours):
1. M
ini-mock (2 hours):4 problems: 1 Binary Tree (medium),1 Binary Tree
(hard), 1 BST (medium), 1 random from Greedy.
2. Review (30 min):Log mistakes.
● Sun (2–3 hours):
1. Catch-Up:If any of Step 13/14 still has stragglers,finish them today.
2. Preview Next Week:ReadStep 15 (Graphs)&Step 16(DP).
Week 7 (Graphs + Dynamic Programming (Part 1))
Goal:
● CompleteStep 15 (Graphs): 32 remaining.
● BeginStep 16 (DP): finish Lec 1–Lec 3 (18 remaining).
Day 1 (Mon):
● Step 15 – Lec 1 (Learning Graphs): 1 remaining
○ S
olve that last concept problem (e.g., “Number of Connected Components” if
not done).
○ ≤ 30 min.
● Step 15 – Lec 2 (BFS/DFS Problems): 4 remaining
○ Solve 2 medium: “Number of Islands” (if not done), “Flood Fill” (variant).
○ Solve 2 medium: “Clone Graph,” “Graph Valid Tree.”
○ ≤ 45 min each.
Day 2 (Tue):
● Step 15 – Lec 2 (BFS/DFS): finish remaining (0 remaining)
○ Wrap up if any left.
● Step 15 – Lec 3 (Topo Sort & Problems): 1 remaining
○ Solve “Course Schedule” or “Alien Dictionary” (whichever is left).
○ ≤ 45 min.
● Step 15 – Lec 4 (Shortest Path Alg & Problems): 12 remaining
○ S
olve 4 medium: “Word Ladder I,” “Number of Provinces,” “Cheapest Flights
Within K Stops,” “Network Delay Time (Dijkstra).”
○ ≤ 45 min each.
Day 3 (Wed):
● Step 15 – Lec 4 (Shortest Path): 8 remaining
○ S
olve 3 hard: “Word Ladder II,” “Critical Connections (Tarjan),” “Minimum
Height Trees.”
○ Solve 2 medium: “01 Matrix,” “Walls and Gates.”
○ ≤ 60 min (hard), ≤ 45 min (medium).
● Step 15 – Lec 5 (MST/Disjoint Set & Problems): 11 remaining
○ S
olve 4 medium: “Number of Islands II (Union-Find),” “Redundant
Connection,” “Accounts Merge,” “Min Spanning Tree (Kruskal).”
○ ≤ 45 min each.
Day 4 (Thu):
● Step 15 – Lec 5 (MST/DSU): 7 remaining
○ S
olve 3 medium: “Friend Circles (Union-Find),” “Max Area of Island (DSU
variant),” “Shortest Path in Weighted Graph (using DSU).”
○ S
olve 2 hard: “Smallest String With Swaps,” “Critical Connections in a
Network (if not done).”
○ ≤ 60 min each.
● Step 15 – Lec 6 (Other Graph Algorithms): 3 remaining
○ S
olve 3 medium: “Word Search II (if using trie + DFS),” “Longest Increasing
Path in a Matrix,” “Surrounded Regions (BFS/DFS).”
○ ≤ 45 min each.
Day 5 (Fri):
● Step 15 – Lec 6 (Other Graphs): finish remaining (0 remaining)
○ If any straggler, wrap up.
● Step 16 – Lec 1 (DP Intro): finish (0 remaining)
○ There was 1/1, so just review.
● Step 16 – Lec 2 (1D DP): finish (0 remaining)
○ You had 5/5 done, just review templates: “Knapsack,” “LIS (simple).”
● Step 16 – Lec 3 (2D/3D DP & DP on Grids): 2 remaining
○ Solve “Unique Paths II (with obstacles),” “Minimum Path Sum.”
○ ≤ 45 min each.
Weekend Revision
● Sat (2–3 hours):
1. M
ini-mock (2 hours):4 problems: 1 Graph (medium),1 Graph (hard), 1 DP
on grid (medium), 1 DFS (hard).
2. Review (30 min):Log mistakes.
● Sun (2–3 hours):
1. Catch-Up:If any Graph or DP (Lec 3) straggles remain,finish.
2. Preview Next Week:ReadStep 16 (Lec 4–Lec 9)andStep 17 (Tries).
eek 8 (Dynamic Programming (Part 2) + Tries + Final
W
Revision)
Goal:
● FinishStep 16 (DP) Lec 4–Lec 9: total 34 remaining.
● FinishStep 17 (Tries): 7 remaining.
● FinishStep 18 (Extra Strings Hard): 7 remaining.
● Then spend the rest of the week on mixed revision + weekend mock(s).
Day 1 (Mon):
● Step 16 – Lec 4 (DP on Subsequences): 4 remaining
○ S
olve 4 medium: “Longest Common Subsequence,” “Longest Increasing
Subsequence (n log n),” “Word Break II (DP),” “Edit Distance.”
○ ≤ 60 min each for the last two, ≤ 45 min each for first two.
● Step 16 – Lec 5 (DP on Strings): 9 remaining
○ S
olve 3 medium: “Interleaving String,” “Regex Matching (DP approach),”
“Palindrome Partitioning (DP approach).”
○ Solve 1 hard: “Wild Card Matching (full DP).”
○ ≤ 60 min each for hard, ≤ 45 min for medium.
Day 2 (Tue):
● Step 16 – Lec 5 (DP on Strings): 5 remaining
○ S
olve 2 medium: “Minimum Palindromic Cuts,” “Longest Palindromic
Subsequence (DP).”
○ S
olve 3 hard: “Scramble String,” “Distinct Subsequences,” “Regular
Expression Matching (advanced).”
○ ≤ 60 min each.
● Step 16 – Lec 6 (DP on Stocks): 6 remaining
○ Solve 3 easy/medium: “Best Time to Buy/Sell Stock I/II/III.”
○ Solve 1 medium: “Maximum Profit with Cooldown.”
○ Solve 1 hard: “Maximum Profit with Transaction Fee.”
○ Solve 1 hard: “Best Time to Buy/Sell Stock IV.”
○ ≤ 60 min each hard, ≤ 45 min each medium.
Day 3 (Wed):
● Step 16 – Lec 7 (DP on LIS): 7 remaining
○ S
olve 3 medium: “Longest Increasing Path in a Matrix,” “Russian Doll
Envelopes (DP variant),” “Minimum Number of Removals to Make Mountain
Array.”
○ S
olve 4 hard: “Longest Increasing Subsequence (n log n code),” “Number of
Longest Increasing Subsequences,” “Trapping Rain Water II (3D DP),”
“Maximal Square.”
○ ≤ 60 min each.
● Step 16 – Lec 8 (MCM & Partition DP): 7 remaining
○ S
olve 3 medium: “Matrix Chain Multiplication,” “Burst Balloons,” “Palindrome
Partitioning II (DP).”
○ S
olve 4 hard: “Optimal BST,” “Split Array Largest Sum (DP variant),”
“Interleaving String (if not done),” “Egg Dropping (Super Egg Drop).”
○ ≤ 60 min each.
Day 4 (Thu):
● Step 16 – Lec 9 (DP on Squares): 2 remaining
○ Solve “Maximal Square” (if not already done), “Count Squares in a 2D Matrix.”
○ ≤ 45 min each.
● Step 17 (Tries): 7 remaining
○ Solve 2 easy: “Implement Trie (insert/search),” “Longest Common Prefix.”
○ Solve 2 medium: “Word Search II (Trie + DFS),” “Replace Words.”
○ Solve 3 hard: “Palindrome Pairs,” “Concatenated Words,” “Word Squares.”
○ ≤ 60 min each for hard, ≤ 45 min each for medium.
Day 5 (Fri):
● Step 18 (Extra Strings Hard): 7 remaining
○ S
olve 4 medium/hard: “Minimum Window Substring (if not done),” “Wildcard
Matching (if not done),” “Edit Distance (if not done),” “Word Pattern II.”
○ S
olve 3 hard: “Text Justification,” “Scramble String (if not done),” “Regular
Expression Matching (if not done).”
○ ≤ 60 min each.
● M
ixed Revision:Pick any 2 previously solved “hard”problems you still feel weak on
and re-solve under 60 min each.
Weekend Revision
● Sat (3 hours):
1. Full Mock (2 hours):
■ 5
problems mixing any unfinished topics (if truly finished everything,
pick 5 random LeetCode “Top Interview Questions” across difficulties).
■ Strict timing:
■ 1
easy → 15 min, 2 medium → (30 min each), 2 hard → (60
min each).
2. D
etailed Post-Mortem (30 min):Log the top 3 weaknesses,plan how to fix
next week.
● Sun (2–3 hours):
1. Weak-Spot Blitz (1 hour):
■ P
ick 3 “hard” problems you struggled with in mock and re-solve under
45 min each.
2. Cheat-Sheet Review (1–2 hours):
■ Review your personal notes:
■ Binary Search templates
■ Sliding Window patterns
■ Greedy justification sketches
■ DP pattern sheet (all 8 lec summaries)
■ Graph algorithms one-pager
■ Trie implementation sketch
🎯 Wrapping Up Before Placements
By the end of Week 8 (Sunday), you should have:
1. All Striver’s Lectures at 100% Completion.
2. A Full Set of Concise Cheat-Sheetsfor each topic.
3. At Least 8 Mock Tests Completed(4+ timed 2 hour mocks,4 mini-mocks).
4. A Mistake Logwith clear notes on where you lost points/time.
5. C
onfidence in “Weak Spots”—you’ve re-solved everyhard problem that gave you
trouble.
🔑 Final Tips & Maintenance
● August “Maintenance Mode”:
○ 1
Problem/Day (Medium)from randomly chosen topics(rotate through all 18
steps).
○ 15 min Reviewof cheat-sheets daily.
○ No new topics—just keep muscles warm.
● During Placements (On-Campus Interviews):
○ Stick to your timed-practice habit (45 min for medium, 60 min for hard).
○ If you encounter a problem you can’t finish, clearly explain your thought
process up to that point.
○ C
ommunicate trade-offs: e.g., “I could optimize this O(n²)→O(n log n) with a
heap/BS.”
ou’ve now got alaser-focused, lecture-by-lecture planthat matches your exact current
Y
progress. Follow this day-by-day, adjust only if you finish early/encounter unexpected
difficulty, and you’ll be fully placement-ready by early August. Good luck!
You might also like
- 8-Week DSA & Competitive Programming Mastery PlanNo ratings yet8-Week DSA & Competitive Programming Mastery Plan7 pages
- Week 1: Arrays, Strings, and Hashing: Medium: HardNo ratings yetWeek 1: Arrays, Strings, and Hashing: Medium: Hard3 pages
- CD 2025 26 Lab5cd 2025 26CD 2025 26 Lab5 Lab5No ratings yetCD 2025 26 Lab5cd 2025 26CD 2025 26 Lab5 Lab59 pages
- 8-Week DSA Preparation Plan For Placements (5-10 LPA)0% (1)8-Week DSA Preparation Plan For Placements (5-10 LPA)6 pages
- Easy Problem Set ( 65 Problems Total) : Practical Sequence For You (Simplified, Beginner-Friendly)No ratings yetEasy Problem Set ( 65 Problems Total) : Practical Sequence For You (Simplified, Beginner-Friendly)5 pages
- 10-Day DSA Learning Plan (2 Hours - Day)No ratings yet10-Day DSA Learning Plan (2 Hours - Day)9 pages
- DSA Topics and Problem Schedule For February 2025No ratings yetDSA Topics and Problem Schedule For February 20255 pages
- Amazon Preparation Tips From Suvanika SenthilrajanNo ratings yetAmazon Preparation Tips From Suvanika Senthilrajan2 pages
- Goal: Duration Resources: 7-Day C++ Roadmap For Internship InterviewsNo ratings yetGoal: Duration Resources: 7-Day C++ Roadmap For Internship Interviews18 pages
- Ultimate 90 Day DSA Mastery Plan With CodeHelpNo ratings yetUltimate 90 Day DSA Mastery Plan With CodeHelp6 pages
- Complexity Theory Chapter Four Complexity TheoryNo ratings yetComplexity Theory Chapter Four Complexity Theory29 pages
- MCQ Questions For Chapter 1 in Digital Design100% (1)MCQ Questions For Chapter 1 in Digital Design10 pages
- The Mathematics of Graphs: Graphs and Euler CircuitsNo ratings yetThe Mathematics of Graphs: Graphs and Euler Circuits16 pages
- DS GTU Study Material Presentations Unit-3 03102019034744AMNo ratings yetDS GTU Study Material Presentations Unit-3 03102019034744AM26 pages
- Digital Design: Boolean Functions & Logic GatesNo ratings yetDigital Design: Boolean Functions & Logic Gates80 pages
- Limits of Computation From A Programming Perspective 1st Edition Bernhard Reus (Auth.) PDF DownloadNo ratings yetLimits of Computation From A Programming Perspective 1st Edition Bernhard Reus (Auth.) PDF Download160 pages
