Permutations II — LeetCode #47
Given a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order*.*
Example 1:
Input: nums = [1,1,2]
Output:
[[1,1,2],
[1,2,1],
[2,1,1]]
Example 2:
Input: nums = [1,2,3]
Output: [[1,2,3],[1,3...
normanaranez.hashnode.dev7 min read