Dynamic Programming I
Problems
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Knapsack | 5/53 (9%) | 7.57 | 4.00 |
| B | Longest Increasing Subsequence | 4/17 (24%) | 4.25 | 4.25 |
| C | Errands | 1/1 (100%) | 1.00 | 1.00 |
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Knapsack | 5/53 (9%) | 7.57 | 4.00 |
| B | Longest Increasing Subsequence | 4/17 (24%) | 4.25 | 4.25 |
| C | Errands | 1/1 (100%) | 1.00 | 1.00 |