Subsets · Coding Interview Practice

SubsetsGiven an array of unique integers, return all possible subsets (the power set) without duplicates.Constraints

1 <= nums.length <= 10

-10 <= nums[i] <= 10

All numbers are unique

Examples

Input: nums = [1,2,3] Output: [[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]]

Input: nums = [0] Output: [[],[0]]

LetsDiscuss

Loading your session…