Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns

Subsets

Explore how to find all possible subsets of a given integer array, including the empty set, while ensuring no duplicates in the solution. Understand the problem constraints, grasp subset fundamentals, and practice implementing a solution in a coding playground.

We'll cover the following...

Statement

Given an array of integers, nums, find all possible subsets of nums, including the empty set.

Note: The solution set must not contain duplicate subsets. You can return the solution in any order.

Constraints:

  • 1≤1 \leq nums.length ≤10\leq 10
  • −10≤-10 \leq nums[i] ≤10\leq 10
  • All the numbers of nums are unique.

Examples

Understand the problem

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

Subsets

1.

Find all subsets for the given set.

nums = [6, 7, 8]

A.

[[], [6], [7], [8], [6, 7], [6, 8], [7, 8]]

B.

[[], [6], [7], [8], [6, 7], [6, 8], [7, 8], [6, 7, 8]]

C.

[[], [6], [6, 7], [6, 8], [7, 8], [6, 7, 8]]

D.

[[6], [7], [8], [6, 7], [6, 8], [7, 8], [6, 7, 8]]

1 / 4

Figure it out!

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Sequence - Vertical
Drag and drop the cards to rearrange them in the correct sequence.
1
2
3
4

Try it yourself

Implement your solution in the following coding playground:

Java
usercode > FindSubsets.java
import java.util.*;
class FindSubsets {
  	public static List<List<Integer>> findAllSubsets(int[] nums) {
        
        // Replace this placeholder return statement with your code
    		List<List<Integer>> setsList = new ArrayList<>();
    		return setsList;
  	}
}
Subsets