Back to DSA notes

Learning roadmap

Search & Recursion

Choose a goal, then follow each stage as an ordered, explained outline.

Learning goal

Learn deeply

Build a durable mental model, then transfer it into a working application.

Foundation

Stage purpose: Establish the vocabulary and first working mental model.

Required background: Complete the linked prerequisites below or bring equivalent experience.

Expected outcome: Explain the core idea and use it in a small example.

Estimated time: 30 minutes

  1. Lesson · Estimated time: 30 minutes

    Hashing

    Outcomes
    • Explain the core idea in Hashing
    • Apply Hashing in a representative exercise

    Prerequisites: No prerequisite topics

    Evidence: Practise the outcome in code and record what you learned.

    Current status: Not started

    Recommended next: Binary Search — A Masterclass in Thinking — Carry the Hashing mental model into the next step with a concrete transfer exercise.

Core concepts

Stage purpose: Connect the concepts into a repeatable problem-solving model.

Required background: Complete the linked prerequisites below or bring equivalent experience.

Expected outcome: Apply the model to a representative exercise without copying a recipe.

Estimated time: 30 minutes

  1. Lesson · Estimated time: 30 minutes

    Binary Search — A Masterclass in Thinking

    Outcomes
    • Explain the core idea in Binary Search — A Masterclass in Thinking
    • Apply Binary Search — A Masterclass in Thinking in a representative exercise

    Prerequisites: Hashing

    Evidence: Practise the outcome in code and record what you learned.

    Current status: Not started

    Recommended next: Backtracking — Eight Problems — Carry the Binary Search — A Masterclass in Thinking mental model into the next step with a concrete transfer exercise.

Applied transfer

Stage purpose: Transfer the concepts into a realistic implementation task.

Required background: Complete the linked prerequisites below or bring equivalent experience.

Expected outcome: Produce a small artifact that proves the decision works.

Estimated time: 30 minutes

  1. Lesson · Estimated time: 30 minutes

    Backtracking — Eight Problems

    Outcomes
    • Explain the core idea in Backtracking — Eight Problems
    • Apply Backtracking — Eight Problems in a representative exercise

    Prerequisites: Binary Search — A Masterclass in Thinking

    Evidence: Practise the outcome in code and record what you learned.

    Current status: Not started

    Recommended next: Complete this path by applying these outcomes in your own project.