<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 solve(vector<int>& nums,set<vector<int>>&ans,vector<int>output,int i,int prev){
if(i==n){
    if(output.size()>1)ans.insert(output);
    return;
}
solve(nums,ans,output,i+1,prev);
if(prev==-1 || (output.size()>0 and nums[i]>=output.back())){
    output.push_back(nums[i]);
    solve(nums,ans,output,i+1,0);
    output.pop_back();
}

}
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        n=nums.size();
         set<vector<int>>ans;
vector<int>output;
         solve(nums,ans,output,0,-1);
         vector<vector<int>>res;
         for(auto it:ans){
        res.push_back(it);
         }
return res;
    }
};
94734