1
00:00:00,450 --> 00:00:02,610
Hey everyone, and welcome back.

2
00:00:02,610 --> 00:00:08,280
Let's do this question, which is a very famous coding interview question called permutations two.

3
00:00:08,700 --> 00:00:17,820
It says given a collection of numbers numb's that might contain duplicates return all possible unique

4
00:00:17,820 --> 00:00:19,950
permutations in any order.

5
00:00:19,950 --> 00:00:24,660
So let's say the input which is given to us is one, one, two.

6
00:00:24,660 --> 00:00:30,960
Now over here this has only three unique permutations, which are these three over here.

7
00:00:30,960 --> 00:00:33,510
And these have to be returned in an array.

8
00:00:33,510 --> 00:00:35,220
So this is the question at hand.

9
00:00:35,220 --> 00:00:42,150
Let's now proceed and discuss how solving this question is very similar to solving the previous question.

10
00:00:42,150 --> 00:00:45,810
And we just need to make slight tweaks to the code.