<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;
    map<vector<int>,int>mp;
    vector<int>cat;
    void BackTrack(int i , int n, vector<int>v)
    {
        if(cat.size()>=2)
        {
            mp[cat]++; 
            if(mp[cat]<=1)  ans.push_back(cat);
        }
        for(int k = i; k<n; k++)
        {
            if(!cat.empty() and cat.back()>v[k]) continue;
            cat.push_back(v[k]);
            BackTrack(k+1,n,v);
            cat.pop_back();
        }
    }
    vector<vector<int>> findSubsequences(vector<int>& nums) 
    {
        int n = nums.size();
        BackTrack(0,n,nums);
        return ans;   
    }
};
38813