akshitagit / akshitagit/JavaScript
LONGEST INCREASING SUBSEQUENCE
Ouverte
good first issue
Hacktoberfest
hacktoberfest2020
INTERVIEW-QUESTION
Javascript
Opensource
- Langage dominant
- JavaScript
- Étoiles
- 90
- Forks
- 106
- Métriques de merge des PR
- Aucune PR mergée en 30 j
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
Guide de contribution
Aucun guide de contribution indexé pour ce dépôt
Évaluation
Cette issue n'a pas encore été évaluée.