Advanced Binary Search | AGGRESSIVE COWS | SPOJ

[@brahmanaidu784]

I never imagined that I can understand this problem, but you made it easy for me, I am really wondering how you got to know this beautiful approach.. thanks a lot

[@kilarieaswar5128]

awesome explaination. The way you reduced it was soo good

[@metalmuscles07]

How the hell did you get this idea Utkarsh? I was clueless till I watched your video. By the way, you are an inspiration to me!

[@mukeshpilaniya6660]

In place of INF at upper limit on binary search you can put maximize distance given in array and in the example you are explaining is 70 max distance.

[@utkarshgupta9858]

I know but infinity will also work... Moreover I think L should be 0 I didn't think that the stalls can be on the same position

[@shivamverma9447]

@@Tarunkumar_Gatla bro inf is assigned a value. it is a macro

[@swagnikdhar6010]

Which Keyboard do you use ??

[@jatinyadav5967]

Thanks 😊 nicely done big 👍 👏 Can you tell how to improve in constructive algorithm?

[@КаналЭйса-ь8в]

Long hard work

[@RudraSingh-pb5ls]

6:41 at this point I could make an approach in O(logn) complexity where n is the difference between the first and the last stall

[@tharunchowdary14]

Please do topic streams like binary search etc creating a problemset

[@satsukun4706]

Needed the soln to this, thanx a lot👍

[@defaultchannel7247]

5:26 shouldn't it be cnt

[@racistindian5316]

which drawing board you use

[@utkarshgupta9858]

wacom one

[@racistindian5316]

@@utkarshgupta9858 ty bro!, && you are doing a great job. Thanku so much.

[@dearshoberoi285]

Thanks!

[@RushatGabhane]

great video!

[@Saitama-kf4oy]

Make more videos like this.

[@alrightpisces3509]

I am just as confused as you are

[@shubhiagarwal4047]

tumhara exact code to run nhi krta hai ullu bana dia

[@utkarshgupta9858]

give submission link

[@xXmayank.kumarXx]

lol