0047 - Permutations II

[anupamabauri]

Description of the Problem

Given a collection of numbers that might contain duplicates, return all possible unique permutations.

Example:

Input: [1,1,2]
Output:
[
[1,1,2],
[1,2,1],
[2,1,1]
]

Code

class Solution:
    def permuteUnique(self, nums: List[int]) -> List[List[int]]:
        

Link To The LeetCode Problem

LeetCode

[anupamabauri]

Please assign this issue to me

[Mrsterius]

I would like to solve this issue using recursion. Please assign if it seems fit.