⚡
DSA Visualizer
🇺🇸 EN
🇧🇷 PT
← Back
Dynamic Programming
Optimization technique for solving complex problems
Fibonacci
Best:
O(n)
Avg:
O(n)
Space:
O(n)
memoization
tabulation
overlapping-subproblems
0/1 Knapsack
Best:
O(n·W)
Avg:
O(n·W)
Space:
O(n·W)
optimization
subset-selection
classic
Longest Common Subsequence
Best:
O(m·n)
Avg:
O(m·n)
Space:
O(m·n)
string
subsequence
diff
Longest Increasing Subsequence
Best:
O(n²)
Avg:
O(n²)
Space:
O(n)
subsequence
patience-sort
ordering
Coin Change
Best:
O(amount·n)
Avg:
O(amount·n)
Space:
O(amount)
optimization
minimum-coins
unbounded