// Source : https://leetcode.com/problems/subsets-ii/?tab=Description 
// Author : codeyu 
// Date : Thursday, March 9, 2017 11:24:26 PM 

/**********************************************************************************
*
* 
* Given a collection of integers that might contain duplicates, nums, return all possible subsets.
* 
* Note: The solution set must not contain duplicate subsets.
* 
* 
* For example,
* If nums = [1,2,2], a solution is:
* 
* 
* 
* [
*   [2],
*   [1],
*   [1,2,2],
*   [2,2],
*   [1,2],
*   []
* ]
* 
*
**********************************************************************************/

using System;
using System.Collections.Generic;
using Algorithms.Utils;
namespace Algorithms
{
public class Solution090 {
    public static IList<IList<int>> SubsetsWithDup(int[] nums) {
throw new NotImplementedException("TODO");
        
    }
}}