Generate All Subsets

Problem

Return every subset of a list of distinct integers, ordered by increasing subset size then lexicographically.

Examples

Example 1

Input: [1,2]

Output: [[],[1],[2],[1,2]]

Example 2

Input: []

Output: [[]]

Input and output use JSON-compatible values. For linked-list and tree questions, arrays represent the node structure as described above. Your code should implement solve(input).

Write your solutionImplement solve(input). Your draft is saved in this browser.

Compiler

How to solve Generate All Subsets

Return every subset of a list of distinct integers, ordered by increasing subset size then lexicographically. At each element, choose include or exclude. The reference implementation illustrates this approach; check the example and edge cases.

Time and space complexity

O(n·2^n) time and output space.

Practise and improve

Choose JavaScript, TypeScript or Python, complete the starter code, then select Run Tests. Request a hint when you need guidance, or choose View solution and confirm if you would like to study the reference implementation.