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 | 6/15 (40%) | 2.14 | 1.67 |
| C | Errands | 4/7 (57%) | 1.75 | 1.75 |
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Knapsack | 11/49 (22%) | 3.77 | 3.55 |
| B | Longest Increasing Subsequence | 6/15 (40%) | 2.14 | 1.67 |
| C | Errands | 4/7 (57%) | 1.75 | 1.75 |