CodingMediumcod-g140

Subject SubsetsLevel Mid–Senior~25 minCommon in Distributed systems · Algorithms & data structures interviewsIndustries Software development

Question

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]) → int

Examples

in[[1,6,11,5]]out1

What 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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.