Loading the journal
Day 14Medium
LeetCode
LeetCodeSubsets (Backtracking)
Backtracking / DFSSolved Nov 11, 2025
Loading the journal
LeetCodeBacktracking / DFSSolved Nov 11, 2025
7 in the last 6 months
Community-reported company tags from leetcode-company-wise-problems (updated 2026-10-08). Bar shows how often each company asks it.
Problem
Given an integer array nums of unique elements, return all possible subsets (the power set). The solution should not contain duplicate subsets.
Reading the solution first feels like progress, but it makes the next similar problem — and the interview version — much harder, because you skipped the part where you figure it out. Give it an honest 20–30 minutes. Stuck? Re-read the pattern, watch the concept video, or try the brute force first.
Hidden: approach · solution code
Watch walkthrough