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

typedef vector<vector<int>> vvi;
typedef vector<int> vi;

class Solution {
private:
    void subSeqGenerator(int i, vi& temp, vi& nums, set<vi>& answer) {
        if(i==nums.size()){
            if(temp.size() >= 2) answer.insert(temp);
            return;
        }
        // Don't Take This
        subSeqGenerator(i+1, temp, nums, answer);
        // take this
        if(temp.size()==0 || temp.back() <= nums[i]){
            temp.push_back(nums[i]);
            subSeqGenerator(i+1, temp, nums, answer);
            temp.pop_back();
        }
    }

public:
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        vi temp;
        set<vi> answer;
        subSeqGenerator(0, temp, nums, answer);
        vvi ans(answer.begin(), answer.end());
        return ans;
    }
};
41095