New Grad - 60 Day DSA Roadmap

Use 60-day pacing in the Plan Builder

1. 1
   Days 1–5

   Baseline and language#

   Reconstruct one previously studied solution each week, complete guided introductions to graph, backtracking, and dynamic-programming state, and keep prerequisite gaps visible.

   Goals

   • Reconstruct one previously studied solution each week, complete guided introductions to graph, backtracking, and dynamic-programming state, and keep prerequisite gaps visible.

   Focus

   concept

   Day 1: Refresh Python interview contractsDay 2: Complexity: name the work you are counting
2. 2
   Days 6–18

   Foundations and core repair#

   Reconstruct one previously studied solution each week, complete guided introductions to graph, backtracking, and dynamic-programming state, and keep prerequisite gaps visible.

   Goals

   • Reconstruct one previously studied solution each week, complete guided introductions to graph, backtracking, and dynamic-programming state, and keep prerequisite gaps visible.

   Focus

   conceptarrays-hashingtwo-pointersstack

   Day 6: Recursion: make each call's contract explicitDay 8: Correctness: explain why the algorithm must workDay 9: Representation: decide what every value meansDay 10: Arrays & HashingDay 11: Two PointersDay 12: Stack
3. 3
   Days 19–33

   Structures and patterns#

   Reconstruct one previously studied solution each week, complete guided introductions to graph, backtracking, and dynamic-programming state, and keep prerequisite gaps visible.

   Goals

   • Reconstruct one previously studied solution each week, complete guided introductions to graph, backtracking, and dynamic-programming state, and keep prerequisite gaps visible.

   Focus

   binary-searchsliding-windowlinked-listtreesbacktrackinggraphs

   Day 19: Binary SearchDay 20: Sliding WindowDay 22: Linked ListDay 23: TreesDay 24: BacktrackingDay 25: Graphs
4. 4
   Days 34–43

   Variants and selected extensions#

   Reconstruct one previously studied solution each week, complete guided introductions to graph, backtracking, and dynamic-programming state, and keep prerequisite gaps visible.

   Goals

   • Reconstruct one previously studied solution each week, complete guided introductions to graph, backtracking, and dynamic-programming state, and keep prerequisite gaps visible.

   Focus

   practiceconcept

   Day 34: Stable Case-Insensitive Label GroupsDay 36: Earliest Longest Unique Event RangeDay 37: Count Signed Target-Sum RangesDay 38: Minimum Ordered Batch CapacityDay 39: Integer arithmetic and coordinate reasoning
5. 5
   Days 44–51

   Mixed and confirmed-format practice#

   Reconstruct one previously studied solution each week, complete guided introductions to graph, backtracking, and dynamic-programming state, and keep prerequisite gaps visible.

   Goals

   • Reconstruct one previously studied solution each week, complete guided introductions to graph, backtracking, and dynamic-programming state, and keep prerequisite gaps visible.

   Focus

   review

   Day 44: Clarify a changed contract before coding
6. 6
   Days 52–57

   Mocks and targeted recovery#

   Reconstruct one previously studied solution each week, complete guided introductions to graph, backtracking, and dynamic-programming state, and keep prerequisite gaps visible.

   Goals

   • Reconstruct one previously studied solution each week, complete guided introductions to graph, backtracking, and dynamic-programming state, and keep prerequisite gaps visible.

   Focus

   mockreview

   Day 52: New Grad - Frequency Ledger CoreDay 53: Turn one failure into a regression test
7. 7
   Days 58–60

   Consolidation and buffer#

   Reconstruct one previously studied solution each week, complete guided introductions to graph, backtracking, and dynamic-programming state, and keep prerequisite gaps visible.

   Goals

   • Reconstruct one previously studied solution each week, complete guided introductions to graph, backtracking, and dynamic-programming state, and keep prerequisite gaps visible.

   Focus

   review

   Day 58: Review and transfer from the mistake logDay 59: Rehearse the final checklist without cramming