| » SPOJ 346. Bytelandian Gold Coins (COINS) |
| » SPOJ 6219. Edit Distance (EDIST) |
Subset Sum/0-1 Knapsack Problem
| » uVA 10664. Luggage |
| » SPOJ 8545. Subset Sum (MAIN72) |
| » SPOJ 97. Party Schedule (PARTY) |
For more problems that can be solved using Dynamic Programming, please visit this URL.
adilakhter λ 