Permutations II

Try to solve the Permutations II problem.

We'll cover the following

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

Examples

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.