<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:
  void helper(vector<int>& nums,int n,vector<int>sol,vector<vector<int>>&ans,int i)
  {
    if(i==n)
    {
        if(sol.size()>1&& std::find(ans.begin(),ans.end(),sol)==ans.end())ans.push_back(sol);
       
        return;
    }
    if(sol.size()==0||sol[sol.size()-1]<=nums[i])
    sol.push_back(nums[i]);
     helper(nums,n,sol,ans,i+1);
     sol.pop_back();
      helper(nums,n,sol,ans,i+1);


  }
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        int n=nums.size();
        if(n==0)return {};
        vector<vector<int>>ans;
        vector<int>sol;
        
        helper(nums,n,sol,ans,0);
        return ans;

    }
};
105005