<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:
    // void solve(vector<vector<int>>&ans,vector<int>&temp,int prev,int curr,vector<int>&nums,map<int,bool>&m){
    //     if(curr>=nums.size()){
    //         if(temp.size()>1){
    //         ans.push_back(temp);
    //         }
    //         return;
    //     }
    //    if(prev==-1||(nums[curr]>=nums[prev]&&m[curr]==false)){

    //       temp.push_back(nums[curr]);
          
          
    //       solve(ans,temp,curr,curr+1,nums,m);
        
    //     temp.pop_back();
          
    //    } 
    //     if(prev==-1||nums[curr]!=temp.back()){
    //    solve(ans,temp,prev,curr+1,nums,m);
    //     }
    // }
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        set<vector<int>>ans;
        vector<int>temp;
        map<int,bool>m;

        for(int i=0;i<(1<<nums.size());i++){
            vector<int>temp;
            for(int j=0;j<nums.size();j++){
                if((1&(i>>j))==1){
                    if(temp.empty()==true||temp.back()<=nums[j]){
                         temp.push_back(nums[j]);
                    }
                    else{
                        break;
                    }
                }
            }
                  if(temp.size()>1){
            ans.insert(temp);
                  }
        }
       
        return vector (ans.begin(),ans.end());
    }
};
60496