Dynamic Programming I
Problems
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Knapsack | 11/49 (22%) | 3.77 | 3.55 |
| B | Longest Increasing Subsequence | 5/14 (36%) | 2.33 | 1.80 |
| C | Errands | 3/5 (60%) | 1.67 | 1.67 |
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Knapsack | 11/49 (22%) | 3.77 | 3.55 |
| B | Longest Increasing Subsequence | 5/14 (36%) | 2.33 | 1.80 |
| C | Errands | 3/5 (60%) | 1.67 | 1.67 |