← Quiz: 0/1 Knapsack and Subset Sum: all 10 questions
Quiz: 0/1 Knapsack and Subset Sum · Question 6 of 10
Which problem is solved by looping the capacity from low to high?
Which problem is solved by looping the capacity from low to high?
- A.0/1 knapsack
- B.Equal partition
- C.Unbounded knapsack, where each item can be used any number of times
- D.Subset sum with each number used once
Answer & explanation
Correct answer: Unbounded knapsack, where each item can be used any number of times
Reusing the updated value is exactly what "unlimited copies" needs.
Can you get the rest right without peeking?
Take the timed Quiz: 0/1 Knapsack and Subset Sum quiz free. Pass it to earn XP and count towards your certificate.
Start the quiz →