Dynamic Programming I
Problems
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Knapsack | 8/42 (19%) | 4.20 | 4.00 |
| B | Longest Increasing Subsequence | 3/12 (25%) | 3.00 | 2.33 |
| C | Errands | 2/3 (67%) | 1.50 | 1.50 |
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Knapsack | 8/42 (19%) | 4.20 | 4.00 |
| B | Longest Increasing Subsequence | 3/12 (25%) | 3.00 | 2.33 |
| C | Errands | 2/3 (67%) | 1.50 | 1.50 |