Generate All Subsets | Dataford Interview Questions

Write a function that generates all possible subsets of a set.

Implement generate_subsets(items), where items is a list of distinct integers. Return a list containing every subset, including the empty subset; preserve the input order within each subset. Any consistent ordering of the returned subsets is acceptable. For example, [1, 2] produces [[], [1], [1, 2], [2]], and [] produces [[]].

Constraints

0 <= len(items) <= 15
All elements in items are distinct integers
The empty subset must be included
Preserve the relative order of elements from items within each subset

Function Signature

def generate_subsets(items):

Your question is Generate All Subsets. 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

Write a function that generates all possible subsets of a set.

Constraints

0 <= len(items) <= 15
All elements in items are distinct integers
The empty subset must be included
Preserve the relative order of elements from items within each subset

Function Signature

def generate_subsets(items):

Your question is Generate All Subsets. 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.