Skip to main content

Go Track

Weekly Goals​

  • DSA
    • Practice:
      • Trees (traversals, height, properties).
      • Graphs (BFS/DFS, shortest path, topological sort).
      • Heaps/priority queues (top-K, scheduling).
    • Perform timed mixed sets.
  • Interview Skills
    • Emphasize clean communication and trade-offs.

Use together with:

Weekly Overview Table​

DayFocus
1Trees – traversals & basic properties
2Trees – lowest common ancestor & variations
3Graphs – BFS/DFS & representations
4Graphs – shortest path & topological sort (basic)
5Heaps/Priority queues – top-K & scheduling
6Mixed timed sets (trees/graphs/heaps)
7Weekly review & full mock DSA interview

Day 1 – Trees: Traversals & Basic Properties​

4-Hour Plan​

  • Block 1 (Concepts – 30–45 min)

    • Review traversals (pre/in/post-order), level-order (BFS).

  • Block 2 (Practice – 90 min)

    • 3 tree problems: traversal, height, counting nodes/leaves.

  • Block 3 (Review – 45–60 min)

    • Write tree traversal templates.

  • Block 4 (Light Backend – 30 min)

    • Brief glance over system design notes.

6-Hour Plan​

  • Add:
    • Extra tree problem (30–45 min): Path sum.

Day 2 – Trees: LCA & Variations​

4-Hour Plan​

  • Block 1 (Concepts – 30–45 min)

    • LCA, BST vs general tree.

  • Block 2 (Practice – 90 min)

    • 3 problems: 1 LCA, 2 variations (symmetric tree, diameter).

  • Block 3 (Review – 45–60 min)

    • Document LCA approaches.

  • Block 4 (Light Backend – 30 min)

    • Skim backend notes.

6-Hour Plan​

  • Add:
    • Extra tree problem (30–45 min).

Day 3 – Graphs: BFS/DFS & Representations​

4-Hour Plan​

  • Block 1 (Concepts – 30–45 min)

    • Graph representations, BFS vs DFS.

  • Block 2 (Practice – 90 min)

    • 3 graph problems: connectivity, components, path existence.

  • Block 3 (Review – 45–60 min)

    • Write BFS/DFS template code.

  • Block 4 (Light Backend – 30 min)

    • Relate to dependency graphs in backend.

6-Hour Plan​

  • Add:
    • Extra graph problem (30–45 min).

Day 4 – Graphs: Shortest Path & Topological Sort​

4-Hour Plan​

  • Block 1 (Concepts – 30–45 min)

    • Dijkstra basics, topological sort for DAGs.

  • Block 2 (Practice – 90 min)

    • 2–3 problems: shortest path, topological sort.

  • Block 3 (Review – 45–60 min)

    • Summarize BFS vs Dijkstra.

  • Block 4 (Light Backend – 30 min)

    • Tie to system design (scheduling, dependency resolution).

6-Hour Plan​

  • Add:
    • Extra shortest path problem (30–45 min).

Day 5 – Heaps/Priority Queues: Top-K & Scheduling​

4-Hour Plan​

  • Block 1 (Concepts – 30–45 min)

    • Min-heap vs max-heap, priority queues.

  • Block 2 (Practice – 90 min)

    • 3 problems: top-K, merge K sorted, scheduling.

  • Block 3 (Review – 45–60 min)

    • Record heap-based patterns.

  • Block 4 (Light Backend – 30 min)

    • Relate to job scheduling.

6-Hour Plan​

  • Add:
    • Extra heap problem (30–45 min).

Day 6 – Mixed Timed Sets​

4-Hour Plan​

  • Block 1 (Timed Set 1 – 90 min)

    • 2 problems: 1 tree, 1 graph/heap.
    • ~40–45 min each.

  • Block 2 (Timed Set 2 – 60 min)

    • 1 additional problem.

  • Block 3 (Review – 30–45 min)

    • Summarize performance and gaps.

6-Hour Plan​

  • Add:
    • Extra quick problem (30–45 min): Weakest area.

Day 7 – Weekly Review & Full Mock DSA Interview​

4-Hour Plan​

  • Block 1 (Mock Interview – 90 min)

    • 2 DSA problems (mix arrays/trees/graphs).
    • Practice speaking thought process.

  • Block 2 (Review – 60 min)

    • Analyze time management, communication, correctness.

  • Block 3 (Planning – 30–45 min)

    • Skim week-16.
    • Update DSA plan and pattern cheat sheet.

6-Hour Plan​

  • Add:
    • Third problem (30–45 min): Weakest topic.