Available question text
Return all distinct non-decreasing subsequences (length ≥ 2) from an integer array — generate subsequences in index order using DFS/backtracking while avoiding duplicate sequences (n ≤ 15, values in [-100,100]).
Related questions
Continue with questions that share topics or the same question type.
- Count Non Decreasing Arrays With Given Digit Sums
Coding · Array · Dynamic Programming · Prefix Sum
- Count Non-Decreasing Subarrays After K Operations
Coding
- Count Numbers with Non-Decreasing Digits
Coding
- Find Longest Non-Decreasing Contiguous Sequence with One Substitution
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Microsoft
Leetcode 491. Non-decreasing Subsequences
Reported May 31, 2026 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source