UR Practice Week 7: Dynamic Programming
Problems
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Longest Common Substring | 1/9 (11%) | 1.80 | 2.00 |
| B | Longest Common Subsequence | 0/0 (0%) | -- | -- |
| C | Knapsack | 0/0 (0%) | -- | -- |
| D | Restaurant Orders | 0/2 (0%) | 1.00 | -- |
| E | Treasure Diving | 0/0 (0%) | -- | -- |
| F | Interval Cover | 0/0 (0%) | -- | -- |
| G | Train Sorting | 0/0 (0%) | -- | -- |
| H | Ants | 1/1 (100%) | 1.00 | 1.00 |
| I | Honeycomb Walk | 1/1 (100%) | 1.00 | 1.00 |
| J | Bribe | 0/0 (0%) | -- | -- |