☰
⚡ AlgoZen
_
//
DYNAMIC_PROGRAMMING
?
~/home
/
path
/
dynamic_programming
🧮
Dynamic Programming
0/6_completed
Break hard problems into overlapping subproblems and cache solutions.
0%
ARR
Fibonacci (Dynamic Programming)
Beginner
O(n)
+200_XP
›
ARR
0/1 Knapsack
Advanced
O(n × W)
+400_XP
›
ARR
Kadane's Algorithm
Intermediate
O(n)
+200_XP
›
ARR
Coin Change
Intermediate
O(n × amount)
+200_XP
›
ARR
Longest Increasing Subsequence
Intermediate
O(n²)
+250_XP
›
ARR
Longest Common Subsequence
Advanced
O(m × n)
+300_XP
›