Hey everyone, and welcome back.
Let's do this question, which is a very famous coding interview question called permutations two.
It says given a collection of numbers numb's that might contain duplicates return all possible unique
permutations in any order.
So let's say the input which is given to us is one, one, two.
Now over here this has only three unique permutations, which are these three over here.
And these have to be returned in an array.
So this is the question at hand.
Let's now proceed and discuss how solving this question is very similar to solving the previous question.
And we just need to make slight tweaks to the code.