Problem 673 · Medium

Number of Longest Increasing Subsequence

Count how many strictly increasing subsequences reach the maximum length. The visual shows each position's length and count growing from earlier smaller values.

Open the interactive visualisation