Dynamic Programming (mandatory, >=2)
Problems
Name | Solved / Tries | Average tries | Average tries to solve | |
---|---|---|---|---|
A | Walrus Weights | 0/0 (0%) | -- | -- |
B | Weighted Interval Scheduling | 0/0 (0%) | -- | -- |
C | Drunk Texting | 0/0 (0%) | -- | -- |
D | Exact Change | 0/0 (0%) | -- | -- |
E | BAAS | 0/0 (0%) | -- | -- |
F | Canonical Coin Systems | 0/0 (0%) | -- | -- |
G | Pebble Solitaire | 0/0 (0%) | -- | -- |
H | Peg Solitaire | 0/0 (0%) | -- | -- |
I | Restaurant Orders | 0/0 (0%) | -- | -- |
J | Presidential Elections | 0/0 (0%) | -- | -- |
K | Knapsack | 0/0 (0%) | -- | -- |
L | Longest Increasing Subsequence | 0/0 (0%) | -- | -- |
M | Nested Dolls | 0/0 (0%) | -- | -- |
N | Honeycomb Walk | 0/0 (0%) | -- | -- |