Home Roadmap Courses Problems Dashboard Pricing

Home Roadmap Courses Problems Dashboard Pricing

Loading editor…

Problem 157

Lesson walkthrough

Subsets

MediumBacktracking

Return every subset of nums (the power set). Sort each subset, then sort the list of subsets by length then lexicographically.

Examples

Example 1

Input: nums = [1,2,3]

Output: [[],[1],[1,2],[1,2,3],[1,3],[2],[2,3],[3]]

Constraints

1 ≤ nums.length ≤ 10All values unique

Target ComplexityNot required

O(n · 2ⁿ) Time · O(n) Space

Companies (6)

AmazonGoogleMetaMicrosoftAppleBloomberg

Node 22.08.0

Loading editor…

Test casesRun to compare output

Inputnums = [1,2,3]

Expected[[],[1],[1,2],[1,2,3],[1,3],[2],[2,3],[3]]

Output—