Tap here to switch tabs
Problem
Submissions

Problem: Permutations II

Permutations II gives you an integer array that may contain duplicates. Return every distinct permutation that can be formed from all of its values, in any order.

Statement

For a given integer list, nums, which might contain duplicates, return all possible unique permutations derived from nums.

Note: The order in which the permutations appear doesn’t matter.

Constraints:

  • 1≤1 \leq nums.length ≤8\leq 8

  • −10≤-10 \leq nums[i] ≤10\leq 10

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Permutations II

Permutations II gives you an integer array that may contain duplicates. Return every distinct permutation that can be formed from all of its values, in any order.

Statement

For a given integer list, nums, which might contain duplicates, return all possible unique permutations derived from nums.

Note: The order in which the permutations appear doesn’t matter.

Constraints:

  • 1≤1 \leq nums.length ≤8\leq 8

  • −10≤-10 \leq nums[i] ≤10\leq 10