| Problem Name | Online Judge | Difficulty Level | |
|---|---|---|---|
| 1 | The Knapsack Problem | SPOJ | 1 |
| 2 | Optimal Array Multiplication Sequence | UVA | 1 |
| 3 | Cutting Sticks | UVA | 1 |
| 4 | Mixtures | SPOJ | 1 |
| 5 | Optimal Binary Search Tree | UVA | 2 |
| 6 | Help the problem setter | SPOJ | 4 |
| 7 | Huffman´s Greed | SPOJ | 5 |