Dynamic Programming I
Problems
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Knapsack | 21/137 (15%) | 5.48 | 6.29 |
| B | Longest Increasing Subsequence | 7/56 (12%) | 6.22 | 3.29 |
| C | Errands | 5/21 (24%) | 3.50 | 3.60 |
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Knapsack | 21/137 (15%) | 5.48 | 6.29 |
| B | Longest Increasing Subsequence | 7/56 (12%) | 6.22 | 3.29 |
| C | Errands | 5/21 (24%) | 3.50 | 3.60 |