PreviousNext
Coding/Dynamic programming

Partition minimum difference

Write codeMedium25 min

Your task

Partition a list of non-negative integers into two subsets and return the minimum possible absolute difference between their sums. Every element must go to exactly one subset. 1 <= len(nums) <= 16, values are non-negative with total sum <= 300. Return the minimum difference.

Examples

min_subset_diff(nums: list[int]) -> int
Example 1
Inputmin_subset_diff([1, 6, 11, 5])
Output1