⚡ AlgoZen_
~/home/dynamic_programming/fibonacci_(dynamic_programming)1 / 6

Fibonacci (Dynamic Programming)

Beginner

Compute Fibonacci numbers by storing previously computed values in a table (memoization). Transforms exponential recursion into linear time.

time:O(n)
space:O(n)
⚡ +200_XP
step[1/21]
> Start
F(0)
0
Compute Fibonacci(10) with Dynamic Programming. Store each result to avoid recomputation.

// tap NEXT STEP to walk through one step at a time