Search across blog, articles, projects, courses, and community posts
A subsequence keeps the original order but may skip elements. Find the length of the longest strictly increasing subsequence of a list.
Input:
n.n integers.Output: the length of the longest strictly increasing subsequence.
1 <= n <= 1000, values between -10^9 and 10^9.
8 10 9 2 5 3 7 101 18
4
5 5 4 3 2 1
1