Unique subsets
Given an integer list that may contain duplicates, return all unique subsets (the power set with duplicates removed). Each subset must be sorted ascending, and the overall list of subsets must be sorted. Input length is at most 10.
Implement
subsets_with_dup(nums: list[int]) → list[list[int]]Examples
in
[[1,2,2]]out[[],[1],[1,2],[1,2,2],[2],[2,2]]What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 22 min
solution.py
InputExpectedGot
[[1,2,2]][[],[1],[1,2],[1,2,2],[2],[2,2]]not run yetsample