Android & iPhone apps are coming soon. Log in for a plan and reminders made for you →

Problem 99 of 159MediumLeetCode

Subsets II

Backtracking

Asked at 8 companies

6 recent

  • Bloomberg
  • Google
  • Microsoft
  • Amazon
  • Meta
  • tcs
  • UiPath
  • Walmart Labs

Community-reported · source · updated 2026-10-08. ● asked in the last 6 months.

  1. 1Basics
  2. 2Paper
  3. 3Code it
  4. 4Watch
  5. 5Visualize
  6. 6Accepted
  7. 7Review

Go step by step: try it yourself before the video and the visual. Progress saves on this device.

Step 1

Know these before you start

Tick what you already know

Concept video

Step 2

Try it on paper

5–10 minutes, no code yet

About this problem

Try a choice, recurse, undo it — subsets, permutations, and search.

Read the full statement and examples on LeetCode, try it for 20–30 minutes, then come back for the walkthrough and the step-by-step visual.

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: optimal solution

Srujan's notes aren't here yet. When he solves this one in his journal, his own writeup and solutions show up on this page too.
Subsets II | AlgoChronicle