Run your code to see results.
Stuck? This challenge exercises:
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.
subsets([1, 2, 3]);
// [
// [],
// [1],
// [2],
// [1, 2],
// [3],
// [1, 3],
// [2, 3],
// [1, 2, 3]
// ]