Combination Sum II with Negative Numbers

Subset Target Sum Medium You are handed a list of integers arr and a desired total goal. The list can contain negative numbers, zeros, and duplicate values. Your task is to return every distinct subset of arr whose elements sum exactly to goal. Here are the selection rules: Each element of arr may be picked at most once. If the same number appears multiple times at different indices, each occurrence is a separate choice. Different subsets that produce the same multiset of…