Need help in approach of problem

#1

please elaborate how to approach

#2

hi @ksalokya
so what ques says is u have to find the length of longest bitonic subsequence. So bitonic here means that the subsequence is first strictly increasing and then decreasing…
This problem is a variation of standard Longest Increasing Subsequence (LIS) problem. Let the input array be arr[] of length n. We need to construct two arrays lis[] and lds[] using Dynamic Programming solution of LIS problem. lis[i] stores the length of the Longest Increasing subsequence ending with arr[i]. lds[i] stores the length of the longest Decreasing subsequence starting from arr[i]. Finally, we need to return the max value of lis[i] + lds[i] – 1 where i is from 0 to n-1.
u can refer this code --> https://ide.codingblocks.com/s/642023

#3

awesome explanation. thank you.

#4

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.