DSA Tracker

Medium

Subsets II

A medium Backtracking problem included in Love Babbar 450, Striver A2Z. Below: the roles whose interviews prioritise this topic, and how to practise it.

Topic
Backtracking
Sheets
2
Core for
0 roles
Platform
LeetCode
Practice in the compilerWatch this solved step by step

The problem

Given an integer array that may contain duplicates, return all possible subsets (the power set). The solution set must not contain duplicate subsets. Subsets can be returned in any order.

Example 1

Input
nums = [1, 2, 2]
Output
[[], [1], [1,2], [1,2,2], [2], [2,2]]
Why
The array has a duplicate 2. Unique subsets are the empty set, singletons [1] and [2], pairs [1,2] and [2,2], and the full set [1,2,2].

Example 2

Input
nums = [0]
Output
[[], [0]]
Why
A single-element array has exactly two unique subsets.

Constraints

  • 1 <= nums.length <= 10
  • -10 <= nums[i] <= 10

How to think about it

Updated 2026-09-09

Duplicate values become identical branches only when chosen at the same decision depth. Sorting the array clusters equal numbers together, turning duplicate prevention into a local rule: inside the same loop iteration, never begin an exploratory branch with an element identical to the one just inspected and discarded.

Approaches, worst first

  1. Power set with hash set filtering

    time O(n * 2^n) · space O(n * 2^n)

    Sort each generated subset and insert it into a hash table to discard duplicates. Correct but wasteful, as it generates the full 2^n search tree and serializes every subset even when almost all branches are redundant.

  2. Sort and skip identical siblingsWrite this one

    time O(n * 2^n) · space O(n)

    Sort first. In the recursive loop from startIndex to n, if i > startIndex and nums[i] == nums[i - 1], skip nums[i]. Identical values can still be picked sequentially in deeper levels, but siblings at the same depth never branch on identical values.

Where people lose marks · 3
  • Skipping duplicates without sorting the array first. If identical values are scattered, adjacent equality checks fail and duplicate subsets escape into the result.
  • Using i > 0 instead of i > startIndex in the skip check. That mistakenly forbids picking legitimate duplicate elements across consecutive recursion depths, such as [2, 2].
  • Modifying or sorting the original array when immutability is expected, rather than sorting a cloned copy.

The theory behind it

Backtracking — the ground this problem stands on. All Backtracking problems

What Backtracking is

Backtracking is an organized trial-and-error search through a maze of possibilities. You make a tentative choice, move forward to explore where that path leads, and if you hit a dead end or finish finding an answer, you back up and undo that choice. By cleaning up your changes before trying the next option, a single shared board or list is explored thoroughly without needing to clone full copies of your data at every turn.

When to reach for it

Reach for backtracking when a problem asks to generate all possible solutions, like all subsets, permutations, valid parentheses combinations, or word search paths on a board. Signals include puzzles with strict constraint rules, like placing eight non-attacking queens on a chessboard or solving a Sudoku grid. Whenever you must construct combinations step by step and abandon dead-end branches early before wasting time exploring impossible paths, use backtracking.

How the pattern works

Follow a three-step rhythm inside a loop: choose, explore, and unchoose. First, check if the current state satisfies your goal; if so, save a copy of it and return. Next, prune illegal moves immediately using constraint checks so unpromising branches are skipped. For each valid candidate, apply the move to your shared path or board, call the recursive function to explore deeper, and finally undo the move right after the call returns. Undoing restores the shared state so sibling choices start from a clean slate.

What each operation costs

OperationTime
generate all subsets of n elementsO(2^n)
generate all permutations of n elementsO(n!)
auxiliary recursion stack memory depthO(n)
What usually goes wrong with Backtracking
  • Adding a mutable path list directly to the final answers collection without creating a shallow copy, leaving every saved result empty once backtracking finishes.
  • Forgetting to undo a state change after the recursive call returns, contaminating subsequent branches with leftover moves from earlier paths.
  • Generating duplicate subsets or permutations by failing to sort the input array and skip adjacent identical elements during branch selection.

Track this in your role's order

Pick your target role and all 370 problems — including this one — resequence to what that interview actually asks. Free.

Start free

More Backtracking problems

Problem set and role mapping as of .