#+ANKI_DECK: study_deck_02
* TODO 0090. Subsets II :medium:
:PROPERTIES:
:NEETCODE: [[file:../../roadmap.org::*0090. Subsets II][0090. Subsets II]]
:END:

Given an integer array ~nums~ that may contain duplicates, return /all possible/ /subsets// (the power set)/.

The solution set *must not* contain duplicate subsets. Return the solution in *any order*.

*Example 1:*


#+begin_src
Input: nums = [1,2,2]
Output: [[],[1],[1,2],[1,2,2],[2],[2,2]]
#+end_src
*Example 2:*


#+begin_src
Input: nums = [0]
Output: [[],[0]]
#+end_src


*Constraints:*

 - ~1 <= nums.length <= 10~

 - ~-10 <= nums[i] <= 10~

** TODO Approach
Write your approach here.

** TODO Python
#+begin_src python :lc-problem 90 :lc-lang python3
class Solution:
    def subsetsWithDup(self, nums: List[int]) -> List[List[int]]:
#+end_src

** TODO C++
#+begin_src cpp :lc-problem 90
class Solution {
public:
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        
    }
};
#+end_src