Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.
Given a collection of numbers that might contain duplicates, return all possible unique permutations.