B. Nastia and a Good Array | Codeforces Round

[@sumitgarg1129]

thanks buddy

[@codeExplainer]

You're welcome!

[@benmaker8275]

Thanks a lot brother, please continue making video like this .. where you also tell the thinking process of yours used during contest.

[@codeExplainer]

Sure I will

[@saket1920]

Bro , your code won't work if the minimum element will occur at the last index. Because then , your ind will be 'n-1' and in your first loop , you're iterating from i+1 so , your i will become 'n' but a[n] doesn't exist.

[@vishalsiddha6637]

Brother what if min element are at 1 st position then how will you proceed ?? You took middle 3 instead of 1st one how you did that?

[@codeExplainer]

it does'nt matter , we just want to make the number left and right side in a increasing way , if the minimum if first then we would make the right side in increasing order.

[@vishalsiddha6637]

@@codeExplainer thanks

[@vishalsiddha6637]

One more question,according to your approach it would always takes O(n) even if we only need one operation for making array a good array i am right??

[@sahilanand30]

Nice explanation

[@codeExplainer]

Thanks for liking. keep learning and keep coding.

[@flanker53]

why are english on these are difficult to understand

[@codeExplainer]

sometimes it happens.

[@theextrovert_]

bhai yrr help krdo ek code mai dikkat a rhi hai

[@codeExplainer]

kya prob aarhe hai ?

[@almuzahid1]

what about A bro 😢

[@anshitmishra]

Already Uploaded kzbin.info/www/bejne/noTSm4itZs93l7c

[@Vikassharma-rq5bh]

bhai khuja le tu phle