README.md

Subsets

Problem can be found in here!

Solution: Recursion

class Solution:
    def subsets(self, nums: List[int]) -> List[List[int]]:
        output_list = []
        self.dfs(output_list, nums, [], 0)
        return output_list

    def dfs(self, output_list: List[List[int]], nums: List[int], current: List[int], index: int):
        output_list.append(list(current))
        for i in range(index, len(nums)):
            current.append(nums[i])
            self.dfs(output_list, nums, current, i+1)
            current.pop()

Time Complexity: , Space Complexity: , where n is the length of array $nums$.