Intermediate
Data Structures & Algorithms
Q64 / 100
What is the 0/1 knapsack problem?
Correct! Well done.
Incorrect.
The correct answer is B) Selecting items with given weights and values to maximize value without exceeding weight capacity, with each item either fully included or excluded
B
Correct Answer
Selecting items with given weights and values to maximize value without exceeding weight capacity, with each item either fully included or excluded
Explanation
0/1 knapsack is an NP-hard optimization problem solved by DP in O(n*W) pseudo-polynomial time. Each item is either taken (1) or not (0).
Progress
64/100