Gamified challenge · 2-D dynamic programming
Item i weighs weights[i] kg and is worth values[i]. Your bag holds at most cap kg. Each item is taken whole or not at all, and there is only one of each.
Write bestValue(weights, values, cap) (Python: best_value) that returns the largest total value you can carry. For weights [1, 3, 4, 5], values [1, 4, 5, 7] and cap = 7 the answer is 9 (the 3 kg and 4 kg items).
There are at most 12 items, weights and values are positive, cap is at most 20, and an empty list or a bag with no room gives 0.
This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.
Sign in with Google