# Power Set – algorithmic and fast

class Solution: # @param A : list of integers # @return a list of list of integers def subsets(self, A): if len(A) == 0: return [[]] h, t = A[0], A[1:] subsets_excluding_h = self.subsets(t) subsets_including_h = [sorted([h] + ss) for ss in subsets_excluding_h] […]