From dec8fcd6539d0114f208de0a87d8ba1190ed5f49 Mon Sep 17 00:00:00 2001
From: Praggya17 <71866834+Praggya17@users.noreply.github.com>
Date: Sat, 28 Oct 2023 17:44:01 +0530
Subject: [PATCH] Create Subsets II Leetcode

recursive function for finding non duplicate subsets
---
 Subsets II Leetcode | 28 ++++++++++++++++++++++++++++
 1 file changed, 28 insertions(+)
 create mode 100644 Subsets II Leetcode

diff --git a/Subsets II Leetcode b/Subsets II Leetcode
new file mode 100644
index 00000000..0f89bae1
--- /dev/null
+++ b/Subsets II Leetcode	
@@ -0,0 +1,28 @@
+class Solution {
+public:
+
+    void check(int i,vector<int>&nums,vector<vector<int>>&ans,vector<int>&v,set<vector<int>>&s)
+    {
+        if(i>= nums.size())
+        {
+                s.insert(v);
+                return;
+        }
+
+        v.push_back(nums[i]);
+        check(i+1,nums,ans,v,s);
+        v.pop_back();
+        check(i+1,nums,ans,v,s);
+
+    }
+    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
+        set<vector<int>>s;vector<vector<int>>ans;vector<int>v;
+        sort(nums.begin(),nums.end()); ///**important**
+        check(0,nums,ans,v,s);
+        for(auto x:s)
+        {
+            ans.push_back(x);
+        }
+        return ans;
+    }
+};