Givng TLE in 0(n) Time complexity

#1

Maximum Bitonic subarray length problem
0(n) solution

#2

can you share the code please
copy the code at https://ide.codingblocks.com/
and save it and share the link

#3

try changing the int to long long int due to the constraints that is causing a runtime error and in online judges a runtime error generally gets reported as TLE, for example on an input where the int circled to a negative number, arr[n] would not be defined and encounter a runtime error

#4
#5

@saurabhvit
Have reopened the doubt?

#6

@saurabhvit
Hello Saurabh,
can u please tell me what issue u r facing

#7

The second doubt you have raised is for a separate question, I’d recommend u to mark this thread as resolved and start a new thread instead as to avoid any confusion and also add the question tag you need the assist for

#8

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.