Subsets
Updated Jan 31, 2026
Problem
Given an integer array nums of unique elements, return all possible subsets (the power set).
The solution set must not contain duplicate subsets. Return the solution in any order.
Constraints
1 <= nums.length <= 10
-10 <= nums[i] <= 10
All the numbers of nums are unique.
Examples
Example 1
Input:
nums = [1,2,3]
Output:
[[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]]
Example 2
Input:
nums = [0]
Output:
[[],[0]]
Function Signature
def subsets(self, nums: list[int]) -> list[list[int]]
How to Submit
Implement a Solution class with a subsets method.
Your method will be called with the input parameters and should return the answer.