The input for this problem will be an array of numbers representing a set, which only contains unique numbers, and your goal is to print every possible set combination, otherwise known as the power set. For example:
input set = [1, 2, 3]power set = [, , , , [1, 2], [2, 3], [1, 3] [1, 2, 3]]
The power set contains every possible combination of numbers. It also includes the empty set which contains no numbers from the original set.
There will be 2N possible combinations of a set of length N because every element can either be in the set or not, which gives us 2 possibilities, and we do this for N numbers, giving us 2 * 2 * 2 ... = 2N.
You need to be a premium member to see the rest of this question and code.