Given a set of distinct integers, nums, return all possible subsets (the power set).
Note: The solution set must not contain duplicate subsets.
Input: nums = [1,2,3]
[ , , , [1,2,3], [1,3], [2,3], [1,2],  ]
See the full details of the problem Subsets at LeetCode