UMN Dynamic Programming
Problems
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Honeycomb Walk | 4/7 (57%) | 1.40 | 1.50 |
| B | Bus Ticket | 1/2 (50%) | 1.00 | 1.00 |
| C | Knapsack | 2/7 (29%) | 2.33 | 3.00 |
| D | A Walk Through The Forest | 2/2 (100%) | 1.00 | 1.00 |
| E | Train Sorting | 1/2 (50%) | 1.00 | 1.00 |
| F | Outing | 1/1 (100%) | 1.00 | 1.00 |
| G | Prince and Princess | 2/2 (100%) | 1.00 | 1.00 |
| H | Collecting Beepers | 1/1 (100%) | 1.00 | 1.00 |
| I | Winning Streak | 0/0 (0%) | -- | -- |
| J | What Does It Mean? | 1/1 (100%) | 1.00 | 1.00 |
| K | Downpayment | 0/0 (0%) | -- | -- |