LeetCodeSubsets (Backtracking)
Backtracking / DFSSolved Nov 11, 2025
Asked at 12 companies
7 recent
- Bloomberg
- Amazon
- Meta
- Agoda
- Microsoft
- TikTok
- Coupang
- Fiverr
- Wix
+2 moreShow fewer
- Walmart Labs
- PayPal
Community-reported · source · updated 2026-10-08. ● asked in the last 6 months.
Go step by step: try it yourself before the video and the visual. Progress saves on this device.
0 / 130 pointsSolved (Medium) 0/40Reviews 0/50Mastered 0/25Practice steps 0/15
Step 1
Know these before you start
Tick what you already know
Concept videoStep 2
Try it on paper
5–10 minutes, no code yet
ProblemProblem statementGiven an integer array nums of unique elements, return all possible subsets (the power set). The solution should not contain duplicate subsets.ReadHide
Problem Description
Given an integer array nums of unique elements, return all possible subsets (the power set). The solution should not contain duplicate subsets.
Step 6
Get it accepted
All test cases pass
Step 7
Review it so it sticks
Re-solve from memory after
Your notes
Three lines in your own words. They come back with this problem's reviews, so you can check yourself after recalling the solution.
Solve it yourself before you look
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 · optimal solution
Stuck? One hint at a time.
Revising this one?
- →Solve it from memory before peeking
- →Say the pattern out loud, not just the code
- →Explain it like you would to a friend
- →Try it again in a different language