<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;

    void solve(vector<int> &nums,int index,vector<int> temp){
        if(index >= nums.size()){
            if(temp.size() >= 2)ans.insert(temp);
            return;
        }

            if(temp.size() == 0 || temp.back() <= nums[index]){
                temp.push_back(nums[index]);
                solve(nums,index+1,temp);
                temp.pop_back();
            }
            solve(nums,index+1,temp);
    }

    vector<vector<int>> findSubsequences(vector<int>& nums) {
        vector<int> temp;

        solve(nums,0,temp);
        vector<vector<int>> t(ans.begin(),ans.end());
        return t;
    }
};
87886