Dynamic Programming I
Problems
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Knapsack | 44/432 (10%) | 8.15 | 8.25 |
| B | Longest Increasing Subsequence | 24/102 (24%) | 3.52 | 3.92 |
| C | Errands | 10/60 (17%) | 4.00 | 4.60 |
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Knapsack | 44/432 (10%) | 8.15 | 8.25 |
| B | Longest Increasing Subsequence | 24/102 (24%) | 3.52 | 3.92 |
| C | Errands | 10/60 (17%) | 4.00 | 4.60 |