<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 f(vector<int>& nums,vector<int> temp,int ind,int prev,set<vector<int>>& st)
    {
        if(ind>=nums.size()) return;
        if(ind==nums.size()-1)
        {
            if(temp.size()>=2)
            {
                st.insert(temp);
            }
            if(nums[ind]>=prev)
            {
                temp.push_back(nums[ind]);
                if(temp.size()>=2)
                st.insert(temp);
                return;
            }
        }
        if(temp.size()>=2) st.insert(temp);
        f(nums,temp,ind+1,prev,st);
        if(nums[ind]>=prev)
        {
            temp.push_back(nums[ind]);
            prev=nums[ind];
            f(nums,temp,ind+1,prev,st);
        }
    }
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        set<vector<int>> st;
        f(nums,{},0,INT_MIN,st);
        vector<vector<int>> res;
        for(auto it:st)
        {
            res.push_back(it);
        }
        return res;
    }
};
75333