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]).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 491. Non-decreasing Subsequences

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact