UMN Dynamic Programming
Problems
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Hello World! | 4/4 (100%) | 1.00 | 1.00 |
| B | Train Sorting | 2/5 (40%) | 1.25 | 1.50 |
| C | A Walk Through The Forest | 1/10 (10%) | 5.00 | 4.00 |
| D | Prince and Princess | 0/0 (0%) | -- | -- |
| E | Collecting Beepers | 0/0 (0%) | -- | -- |
| F | Winning Streak | 0/0 (0%) | -- | -- |
| G | What Does It Mean? | 0/0 (0%) | -- | -- |