<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:
vector<vector<int>> ans; 
set<vector<int>> st;  
     void solve( vector<int>store,int i,vector<int>& nums){
        if(store.size()>=2){st.insert(store);}
       if(i>=nums.size()){return;}
       if(store.size()==0 || nums[i]>=store.back()){
        store.push_back(nums[i]);
        solve(store,i+1,nums);
        store.pop_back();
        solve(store,i+1,nums);
       }
       else{ solve(store,i+1,nums);}
     }
    vector<vector<int>> findSubsequences(vector<int>& nums) {
       vector<int>store; 
       solve(store,0,nums);
    for(auto v:st){
        ans.push_back(v);
    }
      return ans;
    }
};
103864