Given an integer array of unique elements, return all possible subsets (the power set). The solution must not contain duplicate subsets. Return subsets sorted by length, then lexicographically.
subsets([1,2,3]) => [[],[1],[2],[3],[1,2],[1,3],[2,3],[1,2,3]]
Waiting for you...
CodeBot will comment on your code as you write...
Click "Run Code" or press Ctrl+Enter to test your solution