<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:
    int n;
    void find(vector<int>& nums,vector<vector<int>>& result, int idx, vector<int>& curr){
        if(curr.size()>1){
            result.push_back(curr);
            
        }
        unordered_set<int>st;
        for(int i=idx;i<n;i++){
            if((curr.empty()|| nums[i]>=curr.back()) && st.find(nums[i])==st.end()){
                curr.push_back(nums[i]);
                find(nums,result,i+1,curr);
                curr.pop_back();
                st.insert(nums[i]);
            }
        }
    }
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        n=nums.size();
        vector<vector<int>>result;
        vector<int>curr;
        find(nums,result,0,curr);
        return result;
        
    }
};
26259