Given an array of distinct integers, return all possible subsets (the power set).
Input: one line of space-separated integers. Output: one subset per line, elements in ascending order (the empty subset prints as an empty line). Subsets may be produced in any order — the template prints them canonically.
1 2 3
1 1 2 1 2 3 1 3 2 2 3 3
0
0
Run your code against the sample tests, or Submit to run the full suite.