<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>temp,set<vector<int>>& st,vector<int>& nums,int i)
    {
        if(i == nums.size())
        {
            if(temp.size() >= 2) st.insert(temp);
            return;
        }
        solve(temp,st,nums,i+1);
        if(temp.size() == 0 || nums[i] >= temp.back()) 
        {
            temp.push_back(nums[i]);
            solve(temp,st,nums,i+1);
        }
    }

    vector<vector<int>> findSubsequences(vector<int>& nums) {
        vector<vector<int>>ans;
        vector<int>temp;
        set<vector<int>>st;
        solve(temp,st,nums,0);
        for(auto it : st)
        {
            ans.push_back(it);
        }
        return ans;
    }
};
94734