Dynamic Programming (DP) Collection
Problems
Name | Solved / Tries | Average tries | Average tries to solve | |
---|---|---|---|---|
A | Knapsack | 5/32 (16%) | 4.57 | 4.60 |
B | Longest Increasing Subsequence | 8/33 (24%) | 3.67 | 4.00 |
C | Interval Cover | 2/22 (9%) | 5.50 | 7.50 |
D | Restaurant Orders | 4/14 (29%) | 2.80 | 2.50 |
E | Treasure Diving | 1/1 (100%) | 1.00 | 1.00 |
F | Whac-a-Mole | 1/1 (100%) | 1.00 | 1.00 |
G | Spiderman's Workout | 1/8 (12%) | 2.67 | 1.00 |
H | Outing | 3/8 (38%) | 2.00 | 1.67 |
I | Ants | 6/15 (40%) | 2.50 | 2.50 |
J | Digit Sum | 5/6 (83%) | 1.20 | 1.20 |
K | Bribe | 1/1 (100%) | 1.00 | 1.00 |
L | Downpayment | 0/0 (0%) | -- | -- |
M | Honeycomb Walk | 5/8 (62%) | 1.33 | 1.40 |