Leetcode Problem 491. Non-decreasing Subsequences

491. Non-decreasing Subsequences

Leetcode Solutions

Define a backtracking function backtrack that takes the current index and the current subsequence as arguments.
If the current index is equal to the length of the input array, check if the current subsequence has at least two elements and add it to the set of unique subsequences.
Iterate over the remaining elements starting from the current index.
For each element, check if it can be appended to the current subsequence without violating the non-decreasing order.
If it can be appended, call backtrack recursively with the next index and the updated subsequence.
Always call backtrack with the next index and the current subsequence to explore the possibility of not including the current element.
After exploring all possibilities, convert the set of subsequences into a list and return it.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen