Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.
Given a collection of numbers that might contain duplicates, return all possible unique permutations.
The set [1,2,3,...,_n_] contains a total of n! unique permutations.