78. Subsets

https://leetcode.com/problems/subsets/

Given a set of distinct integers, nums, return all possible subsets (the power set).

Note: The solution set must not contain duplicate subsets.

Example:

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

---
Intuition
Generate all combinations, save combination at each stage
---
Related problems
90-subsets-ii
46-permutations
47-permutations-ii
39-combination-sum
40-combination-sum-ii
---