<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 {
    int n;
    set<vector<int>>ans;
    vector<int>part;
    void solve(int i,int j,vector<int>&nums){
        if(part.size()>=2) ans.insert(part);
        if(i==n){
            return;
        }
        if(j==-1||nums[j]<=nums[i]){
            part.push_back(nums[i]);
            solve(i+1,i,nums);
            part.pop_back();
        }
        solve(i+1,j,nums);

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