📊 Dynamic Programming Problems

Master 15 classic DP problems with brute force, recursion, memoization, tabulation, and space-optimized solutions. Every problem includes PHP code, dry runs, and interview variations.

1️⃣
Fibonacci DP

Classic DP introduction. Learn memoization vs tabulation.

View Solution →
2️⃣
0/1 Knapsack

The most famous DP problem. 0/1 choice paradigm.

View Solution →
3️⃣
Fractional Knapsack

Greedy variant where you can take fractions of items.

View Solution →
4️⃣
Coin Change

Minimum coins to make amount. Unbounded knapsack pattern.

View Solution →
5️⃣
Subset Sum

Can we form target sum from a subset?

View Solution →
6️⃣
Partition Equal Subset Sum

Split array into two equal-sum halves.

View Solution →
7️⃣
Longest Common Subsequence

Find longest common subsequence between two strings.

View Solution →
8️⃣
Longest Common Substring

Find longest common substring (contiguous).

View Solution →
9️⃣
Longest Increasing Subsequence

Find longest increasing subsequence in array.

View Solution →
🔟
Edit Distance

Transform one string to another with min operations.

View Solution →
1️⃣1️⃣
Matrix Chain Multiplication

Optimal way to multiply chain of matrices.

View Solution →
1️⃣2️⃣
Rod Cutting

Max profit by cutting rod into pieces.

View Solution →
1️⃣3️⃣
House Robber

Max money without robbing adjacent houses.

View Solution →
1️⃣4️⃣
Egg Dropping Problem

Min attempts to find critical floor.

View Solution →
1️⃣5️⃣
Palindrome Partitioning

Min cuts to partition string into palindromes.

View Solution →