You have not recorded evidence yet. Start with the first recommended topic, then mark the evidence you can demonstrate.
Your progress is available for this visit only because browser storage is unavailable. Keep this page open or record your evidence elsewhere.
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: 35 minutes
Tracker · Estimated time: 35 minutes
Outcomes
Explain the core idea in Arrays Tracker Apply Arrays Tracker in a representative exercise
Prerequisites: No prerequisite topics
Evidence: Practise the outcome in code and record what you learned.
Current status: Not started
Set Not started
Set Learning
Set Practised
Set Applied
Reset status
Recommended next: Tree Problems Tracker — Carry the Arrays Tracker 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: 70 minutes
Tracker · Estimated time: 35 minutes
Outcomes
Explain the core idea in Tree Problems Tracker Apply Tree Problems Tracker in a representative exercise
Prerequisites: Arrays Tracker
Evidence: Practise the outcome in code and record what you learned.
Current status: Not started
Set Not started
Set Learning
Set Practised
Set Applied
Reset status
Recommended next: Dynamic Programming Tracker — Carry the Tree Problems Tracker mental model into the next step with a concrete transfer exercise.
Tracker · Estimated time: 35 minutes
Outcomes
Explain the core idea in Dynamic Programming Tracker Apply Dynamic Programming Tracker in a representative exercise
Prerequisites: Tree Problems Tracker
Evidence: Practise the outcome in code and record what you learned.
Current status: Not started
Set Not started
Set Learning
Set Practised
Set Applied
Reset status
Recommended next: Greedy Algorithms Tracker — Carry the Dynamic Programming Tracker 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: 70 minutes
Tracker · Estimated time: 35 minutes
Outcomes
Explain the core idea in Greedy Algorithms Tracker Apply Greedy Algorithms Tracker in a representative exercise
Prerequisites: Dynamic Programming Tracker
Evidence: Practise the outcome in code and record what you learned.
Current status: Not started
Set Not started
Set Learning
Set Practised
Set Applied
Reset status
Recommended next: Month 1 — Calibration — Carry the Greedy Algorithms Tracker mental model into the next step with a concrete transfer exercise.
Lesson · Estimated time: 35 minutes
Outcomes
Explain the core idea in Month 1 — Calibration Apply Month 1 — Calibration in a representative exercise
Prerequisites: Greedy Algorithms Tracker
Evidence: Practise the outcome in code and record what you learned.
Current status: Not started
Set Not started
Set Learning
Set Practised
Set Applied
Reset status
Recommended next: Complete this path by applying these outcomes in your own project.
Prepare for interviews
Prioritise high-frequency material, retrieve it quickly, and practise explaining it clearly.
Essential
Stage purpose: Secure the concepts that recur in most interviews.
Required background: Complete the linked prerequisites below or bring equivalent experience.
Expected outcome: Give a concise, accurate explanation with one concrete example.
Estimated time: 12 minutes
Tracker · Estimated time: 12 minutes
Outcomes
Explain the core idea in Arrays Tracker Apply Arrays Tracker in a representative exercise
Prerequisites: No prerequisite topics
Evidence: Answer aloud, give a concrete example, and identify the relevant trade-off.
Current status: Weak
Set Weak
Set Revising
Set Can explain
Set Interview ready
Reset status
Recommended next: Tree Problems Tracker — Use Arrays Tracker as the setup for the next interview trade-off and explain the connection aloud.
Frequently asked
Stage purpose: Rehearse implementation choices that invite common follow-up questions.
Required background: Complete the linked prerequisites below or bring equivalent experience.
Expected outcome: Walk through a realistic API decision and defend the trade-offs.
Estimated time: 24 minutes
Tracker · Estimated time: 12 minutes
Outcomes
Explain the core idea in Tree Problems Tracker Apply Tree Problems Tracker in a representative exercise
Prerequisites: Arrays Tracker
Evidence: Answer aloud, give a concrete example, and identify the relevant trade-off.
Current status: Weak
Set Weak
Set Revising
Set Can explain
Set Interview ready
Reset status
Recommended next: Dynamic Programming Tracker — Use Tree Problems Tracker as the setup for the next interview trade-off and explain the connection aloud.
Tracker · Estimated time: 12 minutes
Outcomes
Explain the core idea in Dynamic Programming Tracker Apply Dynamic Programming Tracker in a representative exercise
Prerequisites: Tree Problems Tracker
Evidence: Answer aloud, give a concrete example, and identify the relevant trade-off.
Current status: Weak
Set Weak
Set Revising
Set Can explain
Set Interview ready
Reset status
Recommended next: Greedy Algorithms Tracker — Use Dynamic Programming Tracker as the setup for the next interview trade-off and explain the connection aloud.
Advanced
Stage purpose: Prepare the details that distinguish a deeper answer.
Required background: Complete the linked prerequisites below or bring equivalent experience.
Expected outcome: Connect the concept to reliability, complexity, or production behavior.
Estimated time: 24 minutes
Tracker · Estimated time: 12 minutes
Outcomes
Explain the core idea in Greedy Algorithms Tracker Apply Greedy Algorithms Tracker in a representative exercise
Prerequisites: Dynamic Programming Tracker
Evidence: Answer aloud, give a concrete example, and identify the relevant trade-off.
Current status: Weak
Set Weak
Set Revising
Set Can explain
Set Interview ready
Reset status
Recommended next: Month 1 — Calibration — Use Greedy Algorithms Tracker as the setup for the next interview trade-off and explain the connection aloud.
Lesson · Estimated time: 12 minutes
Outcomes
Explain the core idea in Month 1 — Calibration Apply Month 1 — Calibration in a representative exercise
Prerequisites: Greedy Algorithms Tracker
Evidence: Answer aloud, give a concrete example, and identify the relevant trade-off.
Current status: Weak
Set Weak
Set Revising
Set Can explain
Set Interview ready
Reset status
Recommended next: Complete this path by applying these outcomes in your own project.