Subsets with duplicates
Given an integer array nums that may contain duplicates, return all possible distinct subsets (the power set with no duplicate subsets). Each subset should be sorted ascending, and the returned list should be sorted (by length, then lexicographically as lists). The array has at most 12 elements.
Implement
subsets_with_dup(nums: list[int]) → list[list[int]]Examples
in
[[1,2,2]]out[[],[1],[2],[1,2],[2,2],[1,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 25 min
solution.py
InputExpectedGot
[[1,2,2]][[],[1],[2],[1,2],[2,2],[1,2,2]]not run yetsample