<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:
    set<vector<int>>ans;
    vector<int>level;
    void go(int idx,int prev,vector<int>&nums)
    {
        if(idx==nums.size())
        {
            if(level.size()>1)
            
                ans.insert(level);
                return;
            
        }
        if(prev==-1 || nums[idx]>=nums[prev])
        {
            level.push_back(nums[idx]);
            go(idx+1,idx,nums);
            level.pop_back();
        }
        go(idx+1,prev,nums);
    }
    vector<vector<int>> findSubsequences(vector<int>& nums) {
       go(0,-1,nums);
       vector<vector<int>>finalans;
       for(auto it:ans)
       {
        finalans.push_back(it);
       }
       return finalans;
    }
};
28541