<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<int>&nums,int index,set<vector<int>>&result,vector<int>&output){
        if(index>=nums.size()){
            if(output.size()>1){
                result.insert(output);
            }
            return;
        }
        solve(nums,index+1,result,output);
        if(output.empty() || nums[index]>=output.back()){
              output.push_back(nums[index]);
              solve(nums,index+1,result,output);
              output.pop_back();
        }
    }
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        set<vector<int>>result;
        vector<int>output;
        solve(nums,0,result,output);
        vector<vector<int>>ans(result.begin(),result.end());
        return ans;
    }
};
41095