<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>

void generate(vector<int> &arr , set<vector<int>>& ans , int i = 0 , vector<int> temp = {}){
    if(i == arr.size()){
        if(temp.size() > 1)
            ans.insert(temp);
        return ;
    }

    if(temp.empty() || temp.back() <= arr[i]){
        temp.push_back(arr[i]);
        generate(arr,ans,i+1,temp);
        temp.pop_back();
    }
    generate(arr,ans,i+1,temp);
}

class Solution {
public:
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        set<vector<int>> ans;
        generate(nums,ans);
        vector<vector<int>> toReturn(ans.begin() , ans.end());
        return toReturn;
    }
};
89028