BS-20. Minimise Maximum Distance between Gas Stations | 3 Approaches | Heap | Binary Search 

My bad, a small correction in the code: if((arr[i] - arr[i-1]) == (dist * numberInBetween)) { numberInBetween--; } 1 == (2 * 0.5)

Striver is trying his very best to explain but the problem itself is very complex. Hats off bro...

What a noble man. May he achieve all the success that he wants

Sir please continue the series ...a lot of students are waiting eagerly for your videos .

This guy is a pure genius. The efforts he put in to explain such a complex problem with such simplification requires a genius mind. Kudos to your efforts.

Guys those of you saying use low

Understood Sir, It is most amazing problem I find in binary search and really required more attention, and Sir you have explained it very well in three different approaches , thanks a lot for the video.

Though Striver Bhaiya is at a very nice position today, but according to me, he deserves even more...................God Bless You Bhaiya.........🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻 Thanks a ton..........🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

Hard problem to absorb...! Kudos to your efforts, hats off Striver for your dedication

Effort level:- Inspirational 🏆

it's so hard to wait for gem videos like this , I got a very clear view of BS just because of you bhaiya. Thanks

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

Agar Bharat phir se vishwa guru banta h to Bharat ke us mahan vishwavidyalay me Data Structures and Algorithms ki neev aap hi rakhenge. Aap hi honge DSA ke sabse mahaan teacher. Salute 🫡

Dedication, Made Respect to him!! GIving a complete insight on the topic is just insane and very few people do it!

not missing a single intuition, even if video length goes high, hats off bro..🔥🔥

Best explanation! this was my first hard problem, but you made it so easy to understand. Hats off bhaiya!!!!

The best DSA course on the Internet

Words cannot portray how much grateful I am to you and your teaching. Never ever I have understood a topic with such clearness and depth. Thanks to you I could solve all the problems right from Aggressive cows till Painter's Partition without even looking at any hints.Cannot explain the surreal feeling of getting green ticks on a LC Hard problem that too in the first submission itself!!

I would rather fail interview than trying this binary search solution took me 3 hours to make through this video

Not only Indian programming community but also the entire world programming community is in your debt Sir.

Can't thank you enough for this amazing content!! Explained so perfectly!! Thank you Striver for this course!!

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

awesome striver ! i have understand solution 2 and something something solution 3. you are pro God ❤❤

Great Approach. Really loved the explanation. You made such an hard question easy to understand. Thanks❤❤

Bhai last decimal vala sach me hard h... 2 solution to iska easily samjh gaya. I will give again try tom , at least 30 % aaj samjh me aa gaya.

did this question even before watching video. you taught binary search so good that I was able to do it so easily

Striver please please please Continue with the series ..... Placements are approaching , Completely dependent on ur way of teaching .....Kindly upload videos and complete dsa as early as possible

Striver is excellent to teach hard concept in a easiest way.

striver bhaiya when can we expect the strings playlist? ur explanation is far better than anyone else . and before the fanboys come at me saying that " striver has a job , have patience" , im just asking when we can expect not forcing him :)

Thank you for explaining this difficult question so brilliantly.

Good explanation, please start string then linkedlist, also please add gfg links

I appreciate everything you're doing. However, my only suggestion is, can you keep dark mode while writing code.

Why are the videos not coming? please make a video regarding when the future videos will be released. I am very excited.

Striver bhai plzz start string series i am waiting for it.... ❤️❤️❤️

Very well understood all three approaches specially priority queue one method

Amazing explanation so far🔥

Awesome explanation. still trying to absorb last approach

Hats off to your hardwork brother 🤍🫡

Before Optimizing this with BS It was preety Easy to Solve but When it comes to furthur optimize, the question changes it's difficulty to Hard Nicely Explained Thank You Bhai

From Bruteforce -> better -> optimal. It was really hard question in BS. But anyways Thank You Striver for best explanation.

This surely is an amazing problem

At 37:20, should we only need to insert only one part of the distance or all the parts of the distance, I mean, if there are gas stations at 1 and 13, when we place a new gas station at 7, we will have two distances now, right? 1 to 7 and 7 to 13. We need to insert both distances right. But we are only inserting one of them(Into the Priority Queue).

Plz bhaiya upload more and more videos as soon as possible......plz bhaiya

hey Striver , Just a Small request sir can pls give us the , List of Topics that you will be covering monthly So it will easy for us to knew till when we are able to complete the dsa

Thank You Striver for the best explaination

maybe high have to watch again after sometime awesome video

Absolutely loving your SDE sheet ….please just make a video on Rabin Karp algo and KMP algo…thoda bouncer jara hai uska concepts.

Bhaiya u got the ipad and you are great at explaining things..but its too tough to explain in interview in such a pressure situation😢

Hi, Striver I had asked you in your previous videos when to use while(high-low>1) like conditions. Put some light on it.🙂

Amazing! Dedication is super! Thank you Striver!

Hats off to the explanation. Awesome work sir

UnderStood Striver, and that's awesome. Thanks for making this

Bhai Will You Continue To Upload DSA COURSE VIDEOS AFTER BINARY SEARCH??? PLEASE UPLOAD STRING PLAYLIST BHAI

Bhai site thik kar rahe ho to sath me CN ki jagah GFG ki link dal do please... Or you can make another section beside of CN links, for GFG links please 🥺

If we will make ans variable and try to return it as answer. It will not work in cases where the high itself is the answer , because the mid will never be equal to high , hence the no. of stations function will never return true , hence ans variable will never change . It will just return the value with which it was initialised.

Understood ❤ (1st and 2nd Approach)

Thank you so much Striver.Loved it.💖

no one explains better than you ,thank you

hats off to your efforts sir, very well explained

A small improvement in brute force is u don't need to have a howmany vector u can use the pair in pq

Stack & Queue Series Please Also Linked List.

Instead of checking if the mid exactly divides arr[i+1]-arr[i] or not, we can directly do ceil((arr[i+1]-arr[i]) / mid) - 1 to avoid that issue.

problem: You have a list of numbers that are sorted in increasing order. You also have two numbers, K and X. Your task is to find the K numbers in the list that are closest to X. If two numbers are equally close to X, you should choose the smaller one. For example, if the list A is [2, 6, 7, 10] and K is 2 and X is 8, then the closest numbers to 8 are 7 and 6. Hi. Could you create a binary search video for this "K closest element problem".😶 ps: I have been following your binary search playlist and I am happy that I found exact pattern of updating low, mid and high for all the problems. But in the above problem is there a way to follow the same binary search pattern? I have seen many videos on youtube but everywhere they are updating high = mid and while condition is also different. It is like while(low

His efforts>>>>

Striver, you are my DRIVER💞

Bayya please make sure in SDE sheet the you tube video should be play in other page when we click to watch

I dont think we need the line if((arr[i] - arr[i-1]) == (dist * numberInBetween)) { numberInBetween--; } Beacause even if you remove this line of code, the code gets submitted. I think this is because if we dont have this line, the cnt will be overestimated and so it will automatically execute low=mid and in doing so, it will further execute the high=mid calls and we will reach a answer closer to the actual ans with diff less than 1e-6

at 36:50 line number 13, shouldn't it be long double newSecLen = inDiff / (long double howMany[secInd]); There is no need for a +1 because we already incremented howMany[secInd] at line number 11.

why is the site of takeyouforward down?? please fix it as soon as possible as many are using sde sheet and a2z sheet form there

private int noOfStationsRequired(int[] stations, double dist) { int cnt = 0; for(int i=0; i

sir ek hi dil hai kitne baar jeetoge ❣

bhai can yu tell how many month yu will take complete this course actually i am new this chanel approx 3 month

❗❗FOR THOSE who were not able to get why Striver has written the following line in the last approach: if((arr[i] - arr[i - 1]) / dist) == numberInBetween * dist) THIS IS A MISTAKE IT SHOULD BE: if((arr[i] - arr[i - 1]) == numberInBetween * dist) i.e if a = b / c, then for the confirmation you will do -> b == a * c, not b / c == a * c. Thanks🙏🏻🙏🏻

hi I have solved your a to z sheet and it is a great help but recently you have removed the gfg links and I usually revise from the code that i have solved in the ide. please add the gfg links as well and do not remove the leetcode links. thanks

I directly taught of BS solution, but loved you pq solution.

watching this while I'm drunk ...great watch

Hats off to your hard work 🫡

please striver post the next videos asap we are eagerly waiting for ur vds please, placement start ho gya please complete the series

Sir what do you suggest if i am able to solve question from your sheet after looking at some part of videos or some discussion section of leetcode i mean i am not able to solve new questions by myself but after learning i am able to solve thosr types . So i was just wondering whether its right to look up at the solutions and learn from it or should give more time to solve questions by myself only ? Its a honest question i wish you can answer.

holy sh*t this question was hard to understand, but seriously man what an explanation!

just wow.. u really inspire me sir..

I did not understood the part where we check if it is completely divisible, so we reduce 1, i can't understand the code part for this condition

Hey, Striver I appreciate your efforts and the quality content you are providing for free. I have been following your a2z dsa sheet for a month now and had been solving the questions diligently. I know that coding ninjas is a very good platform but would like to request you to please add a new section of gfg links also as i had did a lot of them on gfg and since all of ot is gone now it is difficult for many people like to go back and search links for those gfg questions. Thank and best wishes

sorry, i cudnt catch the time complexity of the binary search solution. is it O(N + (log(high * 10^6) * N))?

bhaiya ....some game changer was coming on 22nd july

Amazing content bro... Love you so much

Great Explanations, but priority queue approach gets wrong n test3 at gfg

if Interviewer is asking for BS just say i'm done and move on

last wali ne dimaag hila daala bhai!!

Sir please upload strings lectures❤❤🎉❤❤

Striver's site is down...or it is internet issue of mine?

Can someone please explain why Take you forward code (in the website article based on striver's video) for this minimize max distance between gas stations problem(including the correction in pinned comment) passes all test cases in codestudio but gives wrong answer in Geeks for geeks?

@tuf I forgot my account password for loggin in the tuf website, I don't see any option to reset my password 😅 Can you please help me?

could anyone explain this why at this condition if((arr[i] - arr[i-1])/dist == noInBetween*dist ) answer is submitted correct

Your priority queue solution does not get accepted on gfg...cant figure out why

Hey strive can your please add gfg links to A2Z sheet. (Can you people make this comment to reach striver)

Sir please add videos for linked list 😄

Great video sir! Hats off!

Very nice explanation

Done! Nicely explained