Leetcode 491. Non-decreasing Subsequences
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]).
Asked at:
Microsoft
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Late May, 2026
Microsoft
Mid-level
Hello Interview Premium
Your account is free and you can post anonymously if you choose.