<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>> ans;
    void solve(vector<int>& nums, vector<int>& op, int idx, int n, set<vector<int>>& st)
    {
        if(idx == n)
        {
            if(op.size() > 1)
            {
                st.insert(op);
            }
            return;
        }

        vector<int> op1 = op;
        vector<int> op2 = op;

        if(op1.size() == 0 || op1.back() <= nums[idx])
        {
            op1.push_back(nums[idx]);
            solve(nums, op1, idx+1, n, st);
            op1.pop_back();
        }

        solve(nums,op2,idx+1,n,st);
    }

    vector<vector<int>> findSubsequences(vector<int>& nums) {
        int n = nums.size();
        set<vector<int>> st;
        vector<int> op;

        solve(nums, op, 0, n, st);

        ans.assign(st.begin(), st.end());

        return ans;
    }
};
95875