Hey there.
Welcome back.
In this video, let's get started with another coding interview question, which is a very famous question
called Subset's number two.
So the question says given an integer array numb's that may contain duplicates, return all possible
subsets or the power set, the solution set must not contain duplicate subsets.
Return the solution in any order.
So over here we are given an example.
If the input array which is given to us is one, two, two, then this over here is what the expected
output is.