78. Subsets

Given an array of unique integers, return all possible subsets (the power set), in any order, without duplicates.

Every path in the recursion is a subset. Record the current path, then try extending it with each later number.

1function subsets(nums: number[]): number[][] {
2  const res: number[][] = [], path: number[] = [];
3  function dfs(start: number) {
4    res.push([...path]);
5    for (let i = start; i < nums.length; i++) {
6      path.push(nums[i]);
7      dfs(i + 1);
8      path.pop();
9    }
10  }
11  dfs(0);
12  return res;
13}

path = []

nums

start

subsets

[]

Record [].

1 / 0

Space: play/pause · ←/→: step