<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>> ans;
   
    void helpFunc(vector<int>& nums, int currIndex, vector<int> subans)
    {
        if(currIndex >= nums.size())
        {
            if(subans.size() >= 2)
            {
                ans.push_back(subans);
            }
            return;
        } 
        
      
        if( subans.empty() || subans.back() <= nums[currIndex])
        {
            subans.push_back(nums[currIndex]);        
            helpFunc(nums, currIndex + 1, subans);        
            subans.pop_back();   
        }

        if( subans.empty() || subans.back() != nums[currIndex])
            helpFunc(nums, currIndex + 1, subans);    
    }
    
    vector<vector<int>> findSubsequences(vector<int>& nums)
    {
        if(nums.size() < 2) return {};
        
        vector<int> tmp;
        helpFunc(nums, 0, tmp);
        return ans;
    }
};
74191