New update is available. Click here to update.

Longest Increasing Subsequence

MEDIUM

30 mins

73 upvotes

Dynamic Programming

Arrays

Solve problems & track your progress

Checkout your overall progress in every topic here

Become

Sensei

in DSA topics

Open the topic and solve more problems associated with it to improve your skills

Check out the skill meter for every topic

See how many problems you are left with to solve for cracking any stage. Score more than zero to get your progress counted.

Problem

Submissions

Longest Increasing Subsequence

Contributed by

Arshit Babariya

Medium

0/80

Avg time to solve 30 mins

Success Rate 65 %

73 upvotes

Problem Statement

For a given array with N elements, you need to find the length of the longest subsequence from the array such that all the elements of the subsequence are sorted in strictly increasing order.

Strictly Increasing Sequence is when each term in the sequence is larger than the preceding term.

For example:

[1, 2, 3, 4] is a strictly increasing array, while [2, 1, 4, 3] is not.

Detailed explanation ( Input/output format, Notes, Constraints, Images )

Input format:

The first line of input contains an integer 'N', representing the size of the array.

The second line of input contains 'N' space-separated integers, representing the elements of the array.

Output Format:

The only output line contains one integer representing the length of the longest increasing subsequence.

Note:

You do not need to print anything; it has already been taken care of. Just implement the given functions.

Input Constraints

1 <= N <= 10^5
-10^5 <= element <= 10^5

Time Limit: 1sec

Sample Input :

6
5 4 11 1 16 8

Sample Output 1 :

Explanation of Sample Input 1:

Length of longest subsequence is 3 i.e. [5, 11, 16] or [4, 11, 16].

Sample Input 2:

3
1 2 2

Sample Output 2 :

Auto

Console