<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>> findSubsequences(vector<int>& nums) {
        
        function<void(int, int, vector<int>&)> generate;

        set<vector<int>> res;

        generate = [&nums, &res, &generate](int idx, int prev, vector<int>& temp)->void {
            if(idx >= nums.size()) {
                if(temp.size() > 1)
                    res.insert(temp);
                return;
            }

            generate(idx+1, prev, temp);

            if(prev==-1 || nums[idx] >= nums[prev]) {
                temp.push_back(nums[idx]);
                generate(idx+1, idx, temp);
                temp.pop_back();
            }           

        };

        generate(0, -1, *new vector<int>());


        return *new vector<vector<int>>(res.begin(), res.end());
    }
};
44519