<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) {
        int n=nums.size();
        vector<vector<int>> res;
        set<vector<int>> hs;
        
        for(int i=1;i<=(1<<n)-1;i++){
            vector<int> v;
            int f=0;
            for(int j=0;j<n;j++){
                if((i>>j)&1){
                    if(v.empty()||v.back()<=nums[j])
                       v.push_back(nums[j]);
                    else {
                        f=1;
                        break;
                    }        
                } 
            }
            if(f==0 && v.size()>1 && hs.count(v)==0) res.push_back(v),hs.insert(v);
        }
        return res;
    }
};
63920