:orphan:

Subsets II
==========

.. highlight:: none

Problem
-------
https://leetcode.com/problems/subsets-ii/

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:**

::

   Input: nums = [1,2,2]
   Output: [[],[1],[1,2],[1,2,2],[2],[2,2]]

**Example 2:**

::

   Input: nums = [0]
   Output: [[],[0]]

 

**Constraints:**

- ``1 <= nums.length <= 10``
- ``-10 <= nums[i] <= 10``

.. highlight:: python

Pattern
-------
Array, Backtracking, Bit Manipulation

Approaches
----------

.. tab-set::

    .. tab-item:: Backtracking

        **Code**

        .. literalinclude:: ../problems/medium/subsets-ii/subsets_ii__backtracking.py
            :language: python
            :lines: 10-

        **Test**

        >>> from subsets_ii__backtracking import subsetsWithDup
        >>> sorted([sorted(s) for s in subsetsWithDup([1, 2, 2])])
        [[], [1], [1, 2], [1, 2, 2], [2], [2, 2]]
        >>> sorted([sorted(s) for s in subsetsWithDup([0])])
        [[], [0]]

        .. autofunction:: subsets_ii__backtracking.subsetsWithDup