permutations2

Problem Definition

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

Example:

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

Potential Questions to ask

• Can the input be an empty array / slice? Should I handle that?
• Can the input be in any order