Backtracking with a start index naturally avoids duplicates: at each level choose to include or skip the current element.

Subsets

medium

Acceptance: 54%

BacktrackingArrays

Given an array of distinct integers, enumerate every possible subset (the power set). The output must not contain duplicate subsets and may be listed in any order.

Examples

Example 1:

Input:nums = [4,5,6]

Output:[[],[4],[5],[4,5],[6],[4,6],[5,6],[4,5,6]]

Example 2:

Input:nums = [1]

Output:[[],[1]]

Hints

1234567

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

Subsets

Examples

Hints

Related Problems