Distinct permutations
Given a collection of integers nums that may contain duplicates, return all distinct permutations in lexicographic order. The array has at most 8 elements.
Implement
permute_unique(nums: list[int]) → list[list[int]]Examples
in
[[1,1,2]]out[[1,1,2],[1,2,1],[2,1,1]]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,1,2]][[1,1,2],[1,2,1],[2,1,1]]not run yetsample