Non-decreasing Subsequences Solution – LeetCode Solution [Medium] Given an integer array nums, return all the different possible non-decreasing subsequences of the given array with at least two elements. Algorithms, Backtracking & Recursion, Competitive Programming