<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:
 int n;
   void func(int ind,vector<int>ds,set<vector<int>>&st,vector<int>&nums, int prev){
         
           if(ind==n){
               if(ds.size()>=2){
                    st.insert(ds);
                    
               }
               return;
                
           }


                   


           if(nums[ind]>=prev){
                 ds.push_back(nums[ind]);
               func(ind+1,ds,st,nums,nums[ind]);
               ds.pop_back();

           }

           func(ind+1,ds,st,nums,prev);





   }
    vector<vector<int>> findSubsequences(vector<int>& nums) {

            n=nums.size();

           set<vector<int>>st;
           vector<int>ds;

           

           func(0,ds,st,nums,-101);

           vector<vector<int>>ans(st.begin(),st.end());


           return ans;
        
    }
};
90169