Scribd
Upload
33 views3 pages

Dsa Roadmap

The document outlines a structured 5-month study plan for improving problem-solving skills in programming. Each month focuses on specific topics, with daily targets of 2-3 questions and a total time commitment of 2-3 hours per day, gradually increasing in complexity and review. Additional tips include weekly reviews and mock practice to reinforce learning and address weak areas.

Uploaded by

sayedasma0
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
33 views3 pages

Dsa Roadmap

The document outlines a structured 5-month study plan for improving problem-solving skills in programming. Each month focuses on specific topics, with daily targets of 2-3 questions and a total time commitment of 2-3 hours per day, gradually increasing in complexity and review. Additional tips include weekly reviews and mock practice to reinforce learning and address weak areas.

Uploaded by

sayedasma0
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Plan Overview

 Daily Target: Solve 2-3 questions daily.


 Approx Time per Day: 2-3 hours total, divided between solving questions and
reviewing concepts.
 Weekly Focus: Rotate through 2-3 topics weekly to ensure steady progress without
overwhelming yourself.

Month 1: Foundation Building

Focus: Array, String, Searching & Sorting, and Matrix

 Daily Target: 2-3 questions


 Approx Time: ~2-2.5 hours/day
o 30-45 mins: Easy question
o 45 mins-1 hr: Moderate question
o Remaining: Reviewing mistakes/concepts

Weekly Breakdown

Week Topics Questions/Day Total Weekly Questions


Week 1 Array + Matrix 2-3 15
Week 2 String + Array 2-3 15
Week 3 Searching & Sorting 2-3 15
Week 4 Matrix + String 2-3 15

Month 2: Linked Lists, Trees, and Stacks

Focus: Linked List, Binary Tree, Stack & Queue

 Daily Target: 2 questions


 Approx Time: ~2-2.5 hours/day

Weekly Breakdown

Week Topics Questions/Day Total Weekly Questions


Week 1 Linked List 2 10
Week 2 Binary Tree 2 10
Week 3 Stack & Queue 2-3 15
Week 4 Linked List + Binary Tree 2-3 15

Month 3: Intermediate Topics


Focus: Greedy, Backtracking, Heap, and Graphs

 Daily Target: 2-3 questions


 Approx Time: ~2.5-3 hours/day

Weekly Breakdown

Week Topics Questions/Day Total Weekly Questions


Week 1 Greedy + Heap 2-3 15
Week 2 Graphs 2-3 15
Week 3 Backtracking + Heap 2-3 15
Week 4 Graphs + Greedy 2-3 15

Month 4: Advanced Topics

Focus: Dynamic Programming (DP) & Review

 Daily Target: 2 questions (DP-focused) + 1 review question


 Approx Time: ~3 hours/day
o 45 mins-1 hr: Solve one DP problem
o 30-45 mins: Review an older question
o Remaining: Solve a second DP problem

Weekly Breakdown

Week Topics Questions/Day Total Weekly Questions


Week 1 DP Basics (Knapsack, etc.) 2-3 15
Week 2 DP Patterns (LIS, Subset) 2-3 15
Week 3 DP on Trees/Graphs 2-3 15
Week 4 Mixed DP + Review 2-3 15

Month 5: Polishing & Revising

Focus: Mixed Questions, Revising Weak Topics, and Mock Practice

 Daily Target: 3 questions (1 review, 2 new)


 Approx Time: ~2.5-3 hours/day

Weekly Breakdown

Week Topics Questions/Day Total Weekly Questions


Week 1 Mixed Topics (Array, Tree, DP) 3 15
Week 2 Mock Practice (Random) 3 15
Week 3 Mixed Topics (Graph, Linked List) 3 15
Week Topics Questions/Day Total Weekly Questions
Week 4 Review & Final Practice 3 15

Additional Tips

1. Weekly Review (2 hours):


o Go through mistakes and revisit 5-7 questions you struggled with during the
week.
2. Mock Practice:
o By Month 3, start practicing 1 mock test (5-6 random questions) every
weekend.
3. Dynamic Time Adjustment:
o Allocate more time (~3-4 hours) to tough topics like DP and Graphs as you
progress.

You might also like