Problem 491 · Medium

Non-decreasing Subsequences

Find all distinct non-decreasing subsequences of length at least two from an array. The visual explores choices in index order and skips repeated values at the same depth so each sequence appears once.

Open the interactive visualisation