Algorithms · Level 2 of 5
Dynamic Programming
Solving a problem by reusing solutions to overlapping subproblems.
A recurrence and suitable state definition are central to the approach.
Listen to the definition and example
Audio transcript
Dynamic Programming. Solving a problem by reusing solutions to overlapping subproblems. A recurrence and suitable state definition are central to the approach. For example: A sequence alignment algorithm stores optimal scores for smaller prefixes.
Explore this concept
Why it matters
This helps you compare problem-solving methods and their computational tradeoffs.
Start with
Related concepts
Quick recall question
Try answering before looking back at the definition.