Subsets Solutions in PythonNumber 78Difficulty MediumAcceptance 62.1%Link LeetCodeOther languages C++, Java, GoSolutionsPython solution by haoel/leetcodedef subsets(self, nums): res = [] def backtracking(temp, start): res.append(temp[:]) for i in range(start, len(nums)): temp.append(nums[i]) backtracking(temp, i + 1) temp.pop() backtracking([], 0) return resdef subsets(self, nums): res = [] def backtracking(temp, start): res.append(temp[:]) for i in range(start, len(nums)): temp.append(nums[i]) backtracking(temp, i + 1) temp.pop() backtracking([], 0) return res