Learning Experience
Dynamic Programming
Turn exponential recursion into polynomial time by caching the answer to every subproblem the first time it's solved, so it's never recomputed.
Computer ScienceAdvanced10 min readalgorithmsrecursionoptimization
Your learning journey
Every module Axiom offers for dynamic programming — work through them in order, or jump to what you need.
TopicLiveUp next
Explains overlapping subproblems, optimal substructure, memoization vs tabulation, and the knapsack pattern family.
QuizLive
Checks that DP's two required properties — overlap and optimal substructure — are understood, not just one.
AI TutorLive
Answers follow-up questions and adapts the explanation to the learner's level.
Cheat SheetLive
One-glance recall of memoization vs tabulation and the common DP pattern shapes.
VisualizerDeferred
Step-by-step animation of a memo table filling in — no dedicated DP visualizer exists yet.
What to learn next
From Axiom's Knowledge Graph.
Longest Common SubsequenceEdit Distance
Explore the full Knowledge Graph →