1
00:00:01,020 --> 00:00:01,770
Hey there.

2
00:00:01,770 --> 00:00:02,940
Welcome back.

3
00:00:02,940 --> 00:00:09,450
In this video, let's get started with another coding interview question, which is a very famous question

4
00:00:09,450 --> 00:00:11,730
called Subset's number two.

5
00:00:11,820 --> 00:00:21,270
So the question says given an integer array numb's that may contain duplicates, return all possible

6
00:00:21,270 --> 00:00:28,380
subsets or the power set, the solution set must not contain duplicate subsets.

7
00:00:28,410 --> 00:00:30,990
Return the solution in any order.

8
00:00:30,990 --> 00:00:33,540
So over here we are given an example.

9
00:00:33,540 --> 00:00:40,680
If the input array which is given to us is one, two, two, then this over here is what the expected

10
00:00:40,680 --> 00:00:41,640
output is.