<p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>

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

<pre>
<strong>Input:</strong> nums = [4,6,7,7]
<strong>Output:</strong> [[4,6],[4,6,7],[4,6,7,7],[4,7],[4,7,7],[6,7],[6,7,7],[7,7]]
</pre>

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

<pre>
<strong>Input:</strong> nums = [4,4,3,2,1]
<strong>Output:</strong> [[4,4]]
</pre>

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

<ul>
	<li><code>1 &lt;= nums.length &lt;= 15</code></li>
	<li><code>-100 &lt;= nums[i] &lt;= 100</code></li>
</ul>

class Solution {
public:
    map<vector<int>,int>mp;
    void solve(vector<vector<int>>&res,vector<int>&nums,int x,vector<int>&temp){
    if(temp.size()>=2)
        {   
         mp[temp]++;
         if(mp[temp]>1)
             return;
         res.push_back(temp);
     
        }
        if(x>nums.size())
        {
              return ;
        }
        

        for(int i=x;i<nums.size();i++){
            if(temp.size()>=1)
            {if(nums[i]<temp[temp.size()-1])
                continue;}
            
            temp.push_back(nums[i]);
            solve(res,nums,i+1,temp);
            temp.pop_back();//backtracking the changes we made
           
        }
        return;
    }
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        vector<vector<int>>result;
        vector<int>temp;
        solve(result,nums,0,temp);
            
        return result;
    }
};
27400