Permutations II

Medium

Problem

Given a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order.

Input: nums = [1,1,2]

Output: [[1,1,2], [1,2,1], [2,1,1]]

The array contains a duplicate 1. We generate all unique permutations, avoiding duplicates like having two identical [1,1,2] arrangements.

Input: nums = [1,2,3]

Output: [[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], [3,2,1]]

With all unique elements, we get the standard 3! = 6 permutations.

Loading...

Loading Python...