Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1982. 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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.