Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to Backtracking

Ready to read

JSJavaScript⑂Git◎Interview prepΣDSA in JSSDSystem Design
More topics15›
</>HTML{ }CSS⚛ReactNNext.jsNeNest.jsTSTypeScriptNoNode.js🐳DockerDBSQL & Databases✓Testing🔒Web Security☁Cloud & DevOps◈GraphQL◆Redis☸Kubernetes
☰‹›
Description
All topics›JavaScript›Backtracking

Subsets

intermediatelayer I6 · Backtracking5 tests

Given an array nums of distinct integers, return every possible subset (the power set).

  • Build the answer with a bitmask: count from 0 to 2**n - 1 and let bit i of the counter decide whether nums[i] is in that subset
  • The subsets, and the elements inside each subset, may be returned in any order
  • The empty subset counts — subsets([]) is [[]]
  • nums.length is at most 12

Stuck?

All exercisesPlayground
1234567891011121314
loading the editor…

Nothing yet — hit Run and whatever you log shows up here.

Submit to see how you did.

⌘/Ctrl + Enter run⌘/Ctrl + S save⌘/Ctrl + / comment⌘/Ctrl + F find/replace⌘/Ctrl + D select next matchAlt + click multi-cursorTab indent · ⇧Tab outdentEsc leave fullscreen