Double Knapsack | Dataford Interview Questions

Maximum Weight in Two Bags (double knapsack).

Asked in the OA stage. Given item weights and the capacities of two bags, place each item in at most one bag, or leave it unused, to maximize the total weight carried.

Input and Output

Implement max_weight_two_bags(weights, capacity1, capacity2). Return the maximum total weight that can fit in both bags.

Constraints

0 <= len(weights) <= 200
0 <= weights[i] <= 1000
0 <= capacity1, capacity2 <= 1000
Each item may be placed in at most one bag

Function Signature

def max_weight_two_bags(weights, capacity1, capacity2):

Your question is Double Knapsack. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem