0

Given an array arr[] of integers of size N that might contain duplicates, the task is to find all possible unique subsets.
Link to the judge: LINK
Note: Each subset should be sorted.
Example 1:
Input: N = 3, arr[] = {2,1,2}
Output:(),(1),(1 2),(1 2 2),(2),(2 2)
Explanation:
All possible subsets ...