Maximum length bitonic subarray

#1

sir please give me the reference from where i can study about these question

#2

this is pretty helpful
#3

sir i couldn’t understand from it can you refer another thing

#4

@YASHMATHURIA123 for every index we store the length of longest increasing and longest decreasing subarrays. Now to find answer we consider every element as centre element (peak element) and for this peak we take inc[i]+dec[i]-1, we do -1 because we consider current element twice. If still don’t get it, you can see some videos on youtube for [Maximum length bitonic subarray].