<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:
    bool dfs(int i,const vector<int>& candidates,int sum,const int& target,vector<int> currResult,vector<vector<int>>& result){
        sum+=candidates[i];
        if(sum>target){
            return false;
        }
        currResult.push_back(candidates[i]);
        
        if(sum==target){
            result.push_back(currResult);
           return true;
        }
        for(int j=i+1;j<candidates.size();j++){
         //  auto belowTarget= dfs(j,candidates,sum,target,currResult,result);
         if((j>i+1 && candidates[j]==candidates[j-1] )){
            continue;
         }
               if( dfs(j,candidates,sum,target,currResult,result)==false ){
                break;
               };
                // return false;
            
        }
        return true;
    }
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        sort(candidates.begin(),candidates.end());
         vector<vector<int>> result;
        for(int i=0;i<candidates.size();i++){
            int sum=0;
            vector<int> currResult;
            if(i>0 && candidates[i]==candidates[i-1]){
                continue;
            }
            dfs(i,candidates,sum,target,currResult,result);
        }
        // unordered_set<string> s;
        // vector<vector<int>> finalRes;
        // for(auto combin:result){
        //     string str;
        //     for(auto x:combin){
        //         str+=to_string(x);
        //         str+=" ";
        //     }
        //     if(s.count(str)==0){
        //         finalRes.push_back(combin);
        //     }
        //     s.insert(str);
        //}
        return result;
    }
};

/*
candidates = [10,7,6,5,2,1,1], target = 8

               [1,2,5],[1,7],[1,6,1]    
                    [2,6]
                        [7,1]
                        
                        1
                        
                        
 [1,1,2,2]
 
 [10,7,6,5,2,1,1]
 
   [7,1]
      [6,2]
         [5,2,1]

*/
15529