Minimum Subset Sum Difference

Split nums into two groups (every number goes into exactly one; a group may be empty). Return the smallest possible difference between the two sums.

For [1, 6, 11, 5] the answer is 1 (1 + 5 + 6 = 12 and 11).

Examples

Example 1

Input:

min_subset_difference([1, 6, 11, 5])

Output:

1

Example 2

Input:

min_subset_difference([3, 9, 7, 3])

Output:

2

Constraints

• 0 <= len(nums) <= 200
• 1 <= nums[i] <= 100