LONGEST INCREASING SUBSEQUENCE

[akshitagupta15june]

Find the length of the longest subsequence in a given array A of integers such that all elements of the subsequence are sorted in strictly ascending order.
Input Format

The first line contains a single integer n.
Next line contains n space separated numbers denoting the elements of the array.
Constraints

0 < n< 105
0 < Ai < 105
Output Format

Print a single line containing a single integer denoting the length of the longest increasing subsequence.
Sample Input

6
50 3 10 7 40 80

Sample Output

4

Explanation

The longest subsequence in test case is - 3,7,40,80

[Volku]

I want to work on this. Can you assign it to me please?

[akshitagupta15june]

ASSIGNING IT TO U

[Volku]

which folder I have to add this to

[akshitagupta15june]

@Volku YOU CAN ADD IT IN INTERVIEW QUESTION

[ruchikayadav1408]

I would like to contribute to this project.Please assign me this project.I will complete this project in just one day by using comments,appropriate variable names and in most efficient way.Greatly looking ahead to work with you.