Longest Increasing Subsequence (Extra) Problem

Longest Increasing Subsequence (Extra) Problem — ExecCode Medium DSA Practice

Solve the Longest Increasing Subsequence (Extra) problem on ExecCode. Free online medium DSA practice in Arrays - Basics. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Longest Increasing Subsequence (Extra): Patience / DP For Longest Increasing Subsequence (Extra), focus on the exact input variables, return only the requested value, and preserve the required time complexity for the intended pattern.

Examples

Input nums = [10, 9, 2, 5, 3, 7, 101, 18]; Output 4

Constraints

1 ≤ n ≤ 10^4

Practice Longest Increasing Subsequence (Extra) free on ExecCode. Browse DSA problems, topic map, and placement guides.