Return all possible subsets of a given set of distinct integers.
This technical problem deals with returning all possible subsets of a given set of distinct integers. For example, if the input is [1,2,3], the output should be all possible subsets of those integers, which are , , , , [1,2], [1,3], [2,3], and [1,2, 3].
A.I. Evaluation of the Solution
This is a good solution. It is recursive and correctly implements the algorithm. It is also optimal in terms of time and space complexity.