Subset

Asked in:
Amazon
Microsoft

Problem Description

Given a set of distinct integers, A, return all possible subsets.

Note:

Elements in a subset must be in non-descending order.
The solution set must not contain duplicate subsets.
Also, the subsets should be sorted in ascending ( lexicographic ) order.
The list is not necessarily sorted.

Problem Constraints

0 <= |A| <= 20

Input Format

The first argument is an integer array A.

Output Format

Return array of all different possible subsets

Example Input

A = [1, 2, 3]

Example Output

[
 [],
 [1],
 [1, 2],
 [1, 2, 3],
 [1, 3],
 [2],
 [2, 3],
 [3],
]

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.

Start solving Subset on Interview Code Editor

Hints

Hint 1
Solution Approach
Complete Solution

Asked In:

Amazon
Microsoft

Subset

Discussion