Algorithm · LinkedIn · Medium
You are given an array of integers nums in which some values may appear more than once. Return all of the unique permutations that use every element of nums exactly once. Each returned permutation must have the same length as nums and must contain each value exactly as many times as it occurs in the input. No permutation may appear twice in the result. The permutations may be returned in any order. Interview Notes This problem was asked as the coding question in a phone…