Loading…
Step-by-step visualization of DP algorithms: Fibonacci, Coin Change, LCS, Knapsack, Edit Distance. Review the result before reusing it in another workflow.
Range: 0-20
Configure the problem and click "Run Algorithm" to visualize.
Compute the nth Fibonacci number using bottom-up dynamic programming.
The same subproblems are solved multiple times in a naive recursive approach.
An optimal solution can be constructed from optimal solutions of its subproblems.
Top-down approach: store results of expensive function calls and reuse them.
Bottom-up approach: build a table of solutions from smallest to largest subproblems.