Dynamic Programming Visualizer

Step-by-step DP table animation — understand how subproblems build the final answer

1. Choose Problem

N (max 15)

Speed: Medium

Current cell

Dependency

Computed value

Zero / unvisited

Time

O(N)

Space

O(N)

Steps

Each cell = sum of previous two

dp[0] = 0, dp[1] = 1
for i from 2 to n:
  dp[i] = dp[i-1] + dp[i-2]
return dp[n]

{ }

Optimizing your workspace