<p>Given a collection of candidate numbers (<code>candidates</code>) and a target number (<code>target</code>), find all unique combinations in <code>candidates</code>&nbsp;where the candidate numbers sum to <code>target</code>.</p>

<p>Each number in <code>candidates</code>&nbsp;may only be used <strong>once</strong> in the combination.</p>

<p><strong>Note:</strong>&nbsp;The solution set must not contain duplicate combinations.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> candidates = [10,1,2,7,6,1,5], target = 8
<strong>Output:</strong> 
[
[1,1,6],
[1,2,5],
[1,7],
[2,6]
]
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> candidates = [2,5,2,1,2], target = 5
<strong>Output:</strong> 
[
[1,2,2],
[5]
]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;=&nbsp;candidates.length &lt;= 100</code></li>
	<li><code>1 &lt;=&nbsp;candidates[i] &lt;= 50</code></li>
	<li><code>1 &lt;= target &lt;= 30</code></li>
</ul>

class Solution {
public:
void solve(vector<int>& candidates, int target,set<vector<int>>&ans2,vector<int>out,int index){
    //base case
    if(target==0){
        ans2.insert(out);
    }
    for(int i =index;i<candidates.size();i++ ){
         if (i > index && candidates[i] == candidates[i - 1]) continue;
        if(candidates[i]<=target){
            out.push_back(candidates[i]);
            //target -=candidates[i];
            solve(candidates,target-candidates[i],ans2,out,i+1);
            //target+=candidates[i];
            out.pop_back();

        }
    }
}
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        vector<vector<int>>ans;
        vector<int>out;
        set<vector<int>>ans2;
        int i=0;
        sort(candidates.begin(),candidates.end());
        solve(candidates,target,ans2,out,i);
         for (const auto& combination : ans2) {
            ans.push_back(combination);
        }

        return ans;

        
    }
};
14383