Given an integer array nums, that can contain duplicate elements,  return all possible subsets while ensuring that each subset is unique. The output must include unique subsets, and you may return them in any order.

Constraints:

• $1 <=$ nums.length $<= 10$

• $-10 <=$ nums[i] $<= 10$

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.