Maximum Length Bitonic Subarray | GeeksforGeeks

[@reyou7]

Thanks Harshit Jain for his contributions. Great teacher!

[@tusharsaxena8239]

bhai ye toh hume bhi dikh rha hai kya kar rhe hai, ye batao ki kyu kar rhe hai

[@ayushgangwani1359]

7:09 for dec array we are considering non-increasing subarray starting at arr[i] but you have written the reverse of it....btw good explanation

[@manvikarya725]

We subtract one since the current element at ith index is included in both the increasing and decreasing subarray lengths.

[@dinakarmaurya8000]

Excellent idea...index of i and index j - 1 very interesting...

[@prateekmishra6245]

there should be an equality sign

[@iitkop5080]

1st slide dekh hai toh shi...-_-...

[@debarghyachowdhury596]

Can't we sort the array and take the last element from each sorted array and do the operation..

[@ayushaggarwal4714]

nice video

[@prateekmishra6245]

it does not work when elements are equal (as per definition)

[@ayushaggarwal4714]

but why inc+dec -1?

[@ishankbansal9239]

because we are considering max element twice

[@iitkop5080]

did u get it?lmao

[@sanandadeysarkar3721]

Hi
Will the below code work for this program:
Int length =0, maxlength=0;boolean flag =false;
for(int i=0;ia[i]){
length++;
}
else if (a[i+1] 0){
length++;
flag =true;
}
If(length >maxlength && flag){
maxlength = length;
flag = false;
}
}
Please let me know your views. it will help me understand if i am thinking in rihht direction.