⟨⟩Sorting ⌕Searching ⋔Tree ◈Pathfinding ⬡Graph ⊞DP ΣStrings ♛N-Queens ♞Knight's Tour ⌬Hanoi 📚Library 🛠Developer

⊞

Dynamic Programming

fib(n) = fib(n−1) + fib(n−2)

Initialize: fib(0)=0, fib(1)=1

dp table

0

1

0

0

0

0

0

0

0

0

0

Current cellDependenciesTraceback path

Speed55

1 / 11