Partition minimum difference
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.
Implement
min_subset_diff(nums: list[int]) → intExamples
in
[[1,6,11,5]]out1What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
[[1,6,11,5]]1not run yetsample