<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>> findSubsequences(vector<int>& nums) {
        int n=nums.size();
        set<vector<int>> st;
        for(int i=0;i<nums.size();i++)
        {
            
            set<vector<int>> s=st;
            // st.clear();
            for(auto j:s)
            {
                vector<int> v=j;
                if(v.back()<=nums[i])v.push_back(nums[i]);
                st.insert(v);
                
            }
            vector<int> temp;
            temp.push_back(nums[i]);
            st.insert(temp);
        }
        vector<vector<int>> v;
        for(auto i:st)
        {
            vector<int> temp=i;
            if(temp.size()>=2)
            v.push_back(i);
        }
        
        return v;
        
    }
};
51366