Find Array Given Subset Sums

Given the multiset of all 2^n subset sums, reconstruct any original length-n integer array. The core challenge is to infer each element by partitioning the sums into "with/without" groups and recursively recovering values using multiset frequency counting and backtracking to handle positives, negatives, and zeros.