Closest Subset Sum to Goal

Choose any subset (possibly empty) so its sum is as close as possible to goal. Print the minimum absolute difference.

1 <= n <= 40 |nums[i]| <= 10^7 |goal| <= 10^9