Redirecting to
NADOS

Longest Bitonic Subsequence

  Prev   Next

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

1. You are given a number n, representing the number of elements.
2. You are given n numbers, representing the contents of array of length n.
3. You are required to print the length of longest bitonic subsequence of array.
Note -> bitonic subsequence begins with elements in increasing order, followed by elements in decreasing order.
Input Format 
A number n
.. n more elements
Output Format 
A number representing the length of longest increasing subsequence of array.
Question Video
Constraints 
0 <= n <= 20
0 <= n1, n2, .. <= 100
Sample Input 
10
10
22
9
33
21
50
41
60
80
1
Sample Output 
7


  • Asked in Companies
  • Related Topics






Video Solution

Code Solution

Run
 
Run
Id Name