BS-17. Aggressive Cows | Binary Search Hard

Problem Link: bit.ly/3J9ab1B
Notes/C++/Java/Python codes: Soon
We have solved the problem, and we have gone from brute force and ended with the most optimal solution. Every approach's code has been written in the video itself. Also, we have covered the algorithm with intuition.
Full Course: bit.ly/tufA2ZYt
You can follow me across social media, all my handles are below:
Linkedin/Instagram/Telegram: linktr.ee/takeUforward
0:00 Introduction of Course

[@sus_tha_coder]

Aggressive striver

[@shreyasingh1960]

😂😂😭

[@SuyashKumar-fd7gl]

😂

[@technicalteam3298]

you are "The" best teacher In terms of explanation I have tried many KZbinrs like Codehelp, kunal kushwaha but your way of explaining things is much better as you focus on approach not only on coding the things without visualizing possibilities may god bless you for helping many Tier 3 students like me for providing this premium content just for free!

[@anshulgoel1940]

Series from Kunal are incomplete. Even after recent updates, its quite far from completion.

[@albedo9617]

Neetcode is pretty good

[@rickk3300]

@@albedo9617 yes

[@rohitverma1057]

13:24 like he says that range can be optimized. The more optimal lower bound for search space will be the Minimum(adjacent difference). Reason: Let's take array [100, 200, 240, 400, 800]. In this 40 would be the lower bound and not starting from 1. Because if you want to place minimum 2 cows (like question says). You cannot attain difference any lower than this in sorted array which is 40 in this case i.e. Minimum(adjacent difference)

[@user-ik3qu5uy5e]

I am getting crazy with every next video full of excitement and respect for you. How easy , clean , structured the problem and its solution . Best part when the complete story ends with code same as the story we listen, we read it too by the code.

[@elizabethr5161]

Clearly Understood Striver. Thanks for this awesome series.

[@AkshayGoel-of8ic]

I searched for aggressive cow solution and i got you THE BEST EXPLANATION

[@341yes]

This man is magic when comes to a certain set of problems!!!.... Simply, impressed by him! The explanation easily depicts how much hardwork he has put in! HandsOff to you sir!❤

[@cinime]

Understood! Super amazing explanation as always, thank you so so much for your continuous effort!!

[@harshpanwar1550]

You win our hearts in every video, specially the hard problems by explaining them in such a beautiful and simple manner. Thank you for your enormous contributions toward the Coding Community❤

[@himanshurane4847]

I solved this question just after you explained the question, and this is because you explained previous questions so well, and this is the power of your teaching

[@aaryanjavalekar7249]

The best explanation for Aggressive Cows problem!

[@devgarg4331]

coded optimal in one go , without seeing video 😀 . THANKS A LOT STRIVER FOR EVERYTHING

[@lavanyam3224]

After reading the problem statement, I didn't even understand it. It is crystal clear after watching your explanation! Thanks Striver :)

[@venkatamurthy6022]

Your explanation is so clear that even beginners can also understand easily.

[@rohakdebnath8985]

Loved the video. I was stuck in this problem. You have a way with explanations, thanks Striver.

[@sxd6259]

i think you should also optimise the check function a bit more by using lowerbound instead of linear search for the next cow stall index, great solution thought

[@ujjawalraj6096]

Understand everything Min Of Max pattern super duper clear

[@PrajwalCoding]

Heyyy, Thanks for the polarity change explanation. I was shocked understanding the intution

[@stith_pragya]

UNDERSTOOD...Thank You So Much for this wonderful video.............🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

[@Video-Notes]

Best Explanation ............... Best Course on youtube

[@simransaini1227]

Understood !!!!! Grateful of you, Striver🙏

[@52nevil36]

Genereally i never do any comment to video but the guys was insane.. this made DSA too easy for mr (I feel slowly slowly DSA is cup of my v tea)

[@user-ti3bd8mp1w]

understood Thank you striver for such an amazing explanation

[@farheenahmed8286]

The best explanation for aggressive cows problem🙂

[@dayashankarlakhotia4943]

Understood very good explanation than previous explanation

[@aniketwdubey]

In the context of this problem, you could also start with low = 1 since it doesn't make sense to have two rooms at the exact same position. The only reason to start with 0 is to provide a clear lower bound for the binary search. The result wouldn't be affected either way since the binary search would quickly discard unfeasible distances, but starting from 1 would be more intuitive in this context.

[@soumojjalsen1915]

Ya you can write but it wont make any difference in the time taken... The change in time taken is less than 1ms

[@nihaal4699]

Bht hi badiya padaya bhai, maja agya

[@naveensingh596]

Understood...so simple explanation bhaiya💙

[@krishnasharma-rn3sd]

clearly understood bro .awesome explanation!!!

[@shashikumar2382]

Just amazing content , I was unable to understand the question but now i am able to solve it. 💌💌💌🤟

[@ishangujarathi10]

best explanation and intuition

[@shaikkhizar8133]

Super Sir Understood Thankyou for this Lecture

[@CodeMode9313]

Habibi issme thoda mushkil hua samjne me but dimak lagai toh samaj aagai ....tusssi ek number kaam karta hai ...acchi bideo banaata hai

[@rintugayen2435]

Hanuman chalisa padhke iss lecture ko dekh samajh aa jayega

[@srikanthmedicherla4841]

Aggressive understood lol. Great explanation striver!

[@abdulrhmanmagdy7591]

Thank u so much, u are very helpful greeting from Egypt

[@bhagyashreekhairnar683]

Thank you! Lots of gratitude 🌸

[@hareshnayak7302]

Understood,Thanks striver for this amazing video.

[@samreenimam8608]

yes yes, still watching and iked.. tysm

[@sauravkumarjha6162]

amazing explanation as always striver bhaiya

[@Sahilsharma-sk5vr]

your dedication . god bless you

[@sauravchandra10]

Is binary search that easy, or is it the sriver effect? 😊

[@myamazonproducts1683]

yes it obviously strivers effect.

[@deeptidip9864]

Definately his effect💯💯

[@varunaggarwal7126]

woh sirf lagta hai, new problem try karo

[@ShobhitRaghuwanshi-lx2nt]

​@@varunaggarwal7126 true 😂

[@samsmith3961]

since we have to min of max distance we'll have to find divide the distances as equal as possible , then choose the minimum

[@javabytharun]

great explanation, easily understood...............

[@Musicuvakavi1823]

Understood well Sir ... Thank you so much Striver Sir for making such an amazing video... After understanding the problem, I was able to solve without seeing the code Thanks a lot Sir

[@rickk3300]

I solved this question without watching the video just because of the fact that I knew that binary search on answers is going to be applied here, but my question is that how the hell can someone come up with the binary search approach if he/she doesn't know that it is going to be solved using binary search. When I first read this question, the first thought that came to my mind was applying dp.

[@utsavseth6573]

That's the main problem bro.

[@bishalkundu7592]

That's the thing which comes with practice. The more you practice, the more you will solve problems on different topics and you will be able to find patterns in it.

[@ronakraj]

hey @techmaniac2002 now it has been 8 months since you said this and i think you might have practiced many questions since then, and so i wanted to know if you can now find the pattern and say that this question is going to be solved by this approach. or are you still struggling

[@rickk3300]

@@ronakraj Nope, I haven't practiced many questions on DSA since I got placed in the month of August 🙂 I practically left DSA/CP since then...

[@chetanraghavv]

@@ronakraj I think clear distinction between when to apply binary search or DP is that: whenever you observe that answer always lie between a fixed range, and you are getting an answer till a specific point and not getting any answer after a certain value (this is known as monotonic function) then for sure Binary Search can be applied. Whereas in DP, you will be asked to find the optimal answer (minimum or maximum, just like Binary Search) but the problem would be such that you HAVE TO explore all the answers and only after that determine optimal one, this is where recursion comes in which is used to explore all possibilities and finally overlapping subproblems in recursion are optimized using DP. But these things take time and practice.

[@dipingrover1970]

amazing explanation thanks a lot .😊

[@aruna5869]

you are extradinary man!!💛💯

[@manavsingh5919]

thank you striver understood everything 🙂

[@dhruvmalik8052]

great Explanation luv u brother

[@AK-nj1je]

You're seriously a legend 🔥🔥🔥 you made me consistent to dsa Thanks a lot❤ Those who cannot find this question on leetcode, there's a question as 1552. Magnetic Force Between Two Balls which is as same as this you can do that.

[@Shunya_Advait]

Understood Sir, Thank you

[@varun1017]

superb explanation

[@shra1]

Understood very well

[@MJBZG]

amazing question!

[@joeljacob4685]

Understood !! Beautifully explained

[@usmankhatri6836]

Striver! What's next after this amazing BS Playlist?

[@PriyamJamwal]

based on AP, to optimize further you can set high = ceil((double)(stall[n-1] - stall[0]) / (double)c) stall is array of sorted stalls, c is no. of cows

[@Manishgupta200]

Taking high and low is logical and tricky to solve porblem in much more optimal way

[@ritwik121]

someone give him a oscar for the best explanation

[@arjunthakur5827]

My approach sort the array, create an array arrd with difference between consecutive elemnts of the array, if k==2 asign first and last (max distance) if more in arrd, sort it pop until k, the last k poped gives min distance

[@user-or5oz1pk2x]

Thanks a lot Bhaiya

[@ankitdhattarwal2286]

Understood and Thank you

[@priyankaranawat8373]

Thank you soooooooo much 😁

[@shreyasingh1960]

Sir compang will start coming within a month, please upload all the most imp question whivh uou have still not uploaded, topics/question will u think are more important than others!!

[@GauravJain-zo8gt]

jai jinendra sir

[@faizanahmed9304]

19:01 we are sorting as well. O(nlogn)

[@utsavseth6573]

Well, That was lovely.

[@manishkaushik6526]

but for the first approach it is neccessary to sort ?

[@lakshmiprasanna7058]

Understood 💯💯💯

[@PriyankaSingh-sl2wg]

Thank you sir.....❤️

[@user-is6ky7pp2n]

Understood !! 😎😎

[@zooomba62]

what about the time complexity of sorting ? we need to add it right ?

[@YourCodeVerse]

Understood✅🔥🔥

[@culeforever5408]

understood 😇

[@rohanpathak]

Bhaiya thanku for the course,but kab tk complete hoga?pls tell

[@gauravbanerjee2898]

Thanks a lot

[@satwiksrivastava]

Today this problem was asked in Salesforce intern OA with the name of fighting children 😂 The joy of mapping the algorithm.

[@Chandraprakash-kx4ic]

#best #explnation

[@her_soulmate]

Understood 🎉

[@hamzarehman7057]

Sir I had a query. Since I'm learning DSA for the first time. Should I solve the easy questions of all topics and then move to their medium and hard questions. or study a topic like easy>medium>hard and then next topic?

[@ganakkathuria3645]

Solve easy ones , once you have done around 50-60 easy questions then move to

[@ayushagarwal5271]

In the canweplace func, is it okay to do if(cntcows==cows) return true, rather than >= ?

[@amit2197kumar]

Can anyone help me understand why we need to sort the array of stalls in the first place? Thanks.

[@harshilpatel3205]

Understood sir 😉🤍

[@thenriquevicentini]

Understood!

[@rajveersingh2056]

Farthest would be (max - min) / (cows - 1)

[@aaronargottelopez3488]

Thanks!

[@Nimbus2k_rider]

u r awesome...

[@alishashaikh3859]

Hello Striver,I am not able to solve the problems on my own what should i do?

[@_SAHILMAHAJAN]

great striver i thought of DP in this question but the constraint are just too high

[@te083tejaspatil8]

can apply recursion here but we will have to take care of lot of things in that solution

[@ishaanchandak4774]

can we do it using dp i tried it but wasn't getting the correct ans

[@arihantjammar8888]

UNDERSTOOD

[@adgaur090]

understood sir

[@user-js1rx8rs9p]

understood striver

[@rishabh1S]

Not gonna lie, Binary search made it look so simple.

[@harshitjaiswal9439]

Understoooooooooooooood!

[@trixxy8304]

Don't we need to sort the array in linear search too? It should add an extra nlogn to the time complexity right?

[@takeUforward]

Yes small things, you are smart now ;)

[@shreyasingh1960]

​@@takeUforwardaww

[@ganeshvhatkar9253]

Understood

[@ad_akshat]

can we do it like this place one cow in start one cow at thee end and then think something like that??

[@rahulbhagat4023]

why is it necessary to fix the first cow at the first position?

[@itsmrcrazy7670]

waiting for linkedlist videos .>>>