Very less people have shown this solution, most of them then to insert a smaller loop, inside the outer loop, to decrease one count, instead of traversing the array only once !! Thanks

why we need swap function , we can swap inside convertToWave function right?

No Need to use limit() because after sorting in reverse order we already know that 2nd number will be 2nd largest no.

Thank for explaining, I find lot of related videos but this is too good

ye solution video hai ... galti meri thi samajh ne aaya ..

Asked in my recent interview

How do we get such an idea man ? @19:14 pe, nice explanation.

increase sound please.....!!!

❤❤❤❤

Gajab bhai gajab

Sir best method.. Wow seriously

best explanation ❤

Bolna kya chah rhe ho samajh hi NH aa rha :|

Faltu explanation

Thank you sir!! 🙏🙏

Now it's cleared to me. Thanks a lot

Thanks bhaiya bahut badhiyaa video hai..hindi me samjhane k liye dhanyawad

Normal video acha tha

Wor low volume main kar bhai😂

nice bro thanks..

your code is not optimal ,it gives TLE problem ,this approach is not good for O(N) time complexity

But what if the array elements are only in increasing order then in that case also it will not be mountain array but u haven't provide any condition for that?

Good explanation

dont known english??

nice explanation, totally understandable thanks @PrepareYourself

Recursion solution looks very complicated to me .

please yaar bhai , request hai aisi videos mat banaya karo

Nice :)

great explaination

bhai maja aa gaya itna acha to gfg ke founder n b nahi samjaya

Great explanation !

❤

bool solve(int i,int j,string &s,string goal){ //i=0 j=s.length()-1 if(i==j) return false; char temp; temp=s[i]; //change it s[i]=s[j]; s[j]=temp; if(s==goal){ fount=true; return true; } temp=s[i]; s[i]=s[j]; //undo it s[j]=temp; solve(i+1,j,s,goal); //don't move j it might swap and return true with new i solve(i,j-1,s,goal); // "" return false; } can anybody please tell me that why my solution is returning false resuts in some cases.

Hello bro,tumne else me jo while loop use ki h wo hmesa hi true hogi to wo likhne ka koi v mtlb nhi banta h.Aap direct ye likh sakte ho else { res += Math.max(sum1,sum2)+ar1[i]; sum1 = 0; sum2 = 0; i++; j++; }

Great explanation! But how did you frame this formula? Cant we directly return countofOne variable?

good explaination

Nicely described. Note : link for CyclicBarrier in the description is wrong. please correct it.

Sir please, you upload one or more videos daily. We have subscribed your channel.

thanks brother

bhai to the point banaoge tab subscribers karenge na. Time waste karoge toh kaise karein subscribe.

ExecuterService ke case mein cyclic barrier kaise use karen.

Nice Explanation

Very nice explanation sir , I found only this video where explain this problem better in java.

A very genuine conversation with great insights 👍

Pls make some video on microservices and kafka.

bhaiya aap japfu me rehte the ya tiyi me

👌👌💯

👍

Thanks yrr good effort

Thanks bro it helped a lot 🤟🤟🤟