Repository navigation
LONGEST INCREASING SUBSEQUENCE #40
Description
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
Activity
dolonmandal commentedon Sep 26, 2020
I would like to work on this as a part of hacktober fest 2020. Can you please assign it to me.
akshitagupta15june commentedon Sep 26, 2020
Yes Ofcourse
dolonmandal commentedon Sep 26, 2020
should it be strictly javascript or can I use c++?
akshitagupta15june commentedon Sep 26, 2020
If you want to add in cpp then please go to cpp repo Where there is the same issue raised
raman-thakur commentedon Sep 26, 2020
i can do this using java script!!
can you pls assign it to me for the hacktober fest 2020???
akshitagupta15june commentedon Sep 26, 2020
ok assigning