← Questions
From 0/1 knapsack to bounded knapsack
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Start with the 0/1 knapsack: items with weights and values, a capacity, and each item used at most once; return the best total value. Then each item may be used up to a given count. Extend the DP, first naively and then efficiently (for example by splitting counts into powers of two), and compare the complexities.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding