Leetcode 3647. Maximum Weight in Two Bags

Given an array of item weights and two bag capacity limits, assign each item to one of the two bags (or leave it out) to maximize the total packed weight without exceeding either capacity. The core challenge is a two-dimensional 0/1 knapsack problem—typically solved with DP over both capacities or by reducing to repeated single-knapsack solves.