<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>>result;
    set<vector<int>>st;
    int n;
    void solve(vector<int>&nums,int i,vector<int>curr){
        if(i==n){
            if(curr.size()>=2 && st.count(curr)==0){
                result.push_back(curr);
                st.insert(curr);
            }
            return;
        }
        if(curr.empty()||curr.back()<=nums[i]){
            curr.push_back(nums[i]);
            solve(nums,i+1,curr);
            curr.pop_back();
        }
        solve(nums,i+1,curr);
    }
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        n=nums.size();
        vector<int>curr;
        solve(nums,0,curr);
        return result;
    }
};
103864