Test Cases not passing for Maximum length bitonic subarray

#1

I have implemented the algorithm mentioned in the editorial and sample case is passing but i am getting tle in one case and wrong answer in two others. Please help me find the error

#2

@Aditya.Jethliya don’t forget equal to condition!
so check arr[i]>=arr[i-1] and arr[i]<=arr[i+1]

#3

Thanks! Wrong cases got solved. But i am still getting TLE in one case.

#4

I recommend you trying again as it is passing every testcase for me!
also the solution is O(n) and cannot be optimized further in time complexity.

#5

Yes. It worked today. Thanks!

#6

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.