Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to Basic recursion

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›Basic recursion

Generate All Subsets

beginnerlayer B10 · Basic recursion5 tests

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

  • n values produce 2^n subsets, including the empty subset and the whole array
  • Subsets, and the values inside them, may be returned in any order
  • Solve it recursively — bitmask tricks are not the exercise here
  • subsets([]) is [[]]

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