Subsets of a Set | Dataford Interview Questions

Subsets: return all subsets of a set.

Asked in the Round 2 stage. Use recursive/backtracking first, then iterative if helpful.

Function

subsets(nums)

Given a list of distinct integers nums, return all possible subsets, including the empty subset and nums itself. The order of subsets does not matter.

Input and Output

Input: nums, a list of distinct integers
Output: a list of lists, where each inner list is one subset

Constraints

0 <= len(nums) <= 10
nums contains distinct integers
-10^9 <= nums[i] <= 10^9

Function Signature

def subsets(nums):

Your question is Subsets of a Set. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem