How to appraoch the bitonic sequence problem?

#1

ia am not able to understand how to start?

#2

Hi @kailash_01
In this question what you can do is make 2 arrays: left and right.
In left array store the length of non-decreasing subarray ending at arr[i]. Create it while traversing on array from left to right.
Similarlry, in right array store the length of non-decreasing subarray ending at arr[i]. This time traverse on array from right to left.
Now find maximum value of (left[i] + right[i] - 1 ). This is your answer.

#3

I did that only but one of test case is failing