Gas Station (Google, Amazon, Uber, Microsoft, FactSet, Zoho, Flipkart) : Explanation ➕ Live Coding

[@nishant7083]

Bro u ll be famous 3months juss 3 months

[@codestorywithMIK]

Thats means a lot to me Nishant ❤️❤️❤️ Thanks a lot

[@nishant7083]

@@codestorywithMIK one request start funny and interesting explanation for dsa System design was really good

[@codestorywithMIK]

Sure Nishant. Feedback taken Thanks a lot. Will keep this in mind ❤️❤️❤️

[@nishant7083]

@@codestorywithMIK you r reply faster than my reflexes ... Relfex-- , mik++

[@codestorywithMIK]

🙏😇😊😊😊

[@tauquirahmed1879]

People who make boring videos are afraid to make long videos. Whenever I see your video is long then I watching it intentionally thinking "Yr bhaiya ne zarur koi bht mast approach bataya hoga". Honestly I feel like, why I didn't come to know about your channel in my 1st year.

[@codestorywithMIK]

It means a lot Tauquir. Thank you so much ❤️❤️❤️

[@annagarg2567]

((best)^(best))^(1/0)

[@kartikeyparashar6563]

I am Pursuing my FULLSTACK Program from scaler. I just get my DSA Certification from SCALER as well. But, I just thought to keep practicing the Qs. I am watching your videos daily. Mtlb kya samjhaane ka tarika h yr aapka. Worth it to spend every single second on your KZbin Channel.

[@souravjoshi2293]

Sorry NeetCode, no offence, but this guy has got some serious teaching skills. Explained it better than you. Man you are on fire 🔥🔥🔥🔥🔥🔥🔥

[@codestorywithMIK]

💪❤️

[@divasbhadani9225]

Easiest Brute Force Approach: class Solution { public: bool completeCircuitUtils(vector& gas, vector& cost, int start) { int n = gas.size(); int j = start, tank = 0; do { tank += (gas[j] - cost[j]); if (tank < 0) { return false; } j = (j + 1) % n; } while (j != start); return true; } int canCompleteCircuit(vector& gas, vector& cost) { for (int i = 0; i < gas.size(); i++) { if (completeCircuitUtils(gas, cost, i)) { return i; } } return -1; } };

[@RajanSingh-xr7cf]

bro when will i think like u

[@namanbhatia9872]

sir, please make videos on dynamic programming concepts. I do not get to know that when to apply and solve problem by dynamic programming approach after reading the question.

[@codestorywithMIK]

Planning it soon Naman. Thanks for your suggestion and watching my videos ❤️❤️❤️

[@priyanshugautam5648]

Bhaiya book allocation aur aise baaki binary search k hard Qns please smjha dijiye binary search ho jayega to confidence aayega please.... Thank you

[@codestorywithMIK]

Sure Priyanshu. Planning soon Thanks for your suggestions 💪❤️

[@udayshankar-e6v]

Thoda execution speed or optimize ho sakta h , agar total kamai and totalkharcha loop me hi calculate kar le. and last me check laga de totalKmai < kharcha to return -1 else return result . Bahut aage jaoge bhai..bawal padhate ho😎

[@ashmitpatel4829]

Thank you sir for explanation Sir jab aap greedy ka question dekhte h to matlab aapko ye pta kaise chalta h ki isme greedy lagegi questions mein koi hint rehti h kya jisse aap pta kr paate ho ya practise se hi ayega

[@codestorywithMIK]

Hi Ashmit, Actually there are two types of Greedy Qns which I have observed till now : 1) Very easy to figure out - Example : Maximum ice cream bars, where you had to just sort array so that greedily you buy cheapest ice creams 2) Tough ones - like this Qn “Gas Station”, These only come with practice. And tbh, I always forget this problem. But yeah, with practice only, these can be cracked.

[@dayashankarlakhotia4943]

public int canCompleteCircuit(int[]gas,int[]cost){ int n=gas.length,total=0,position=0,sum=0; for(int i=0;i

[@danishsaifi1038]

I was waiting for your video. Even though I was able to solve this question previously but could not able to solve it today. Feeling low 😥😥😥

[@codestorywithMIK]

Don’t feel low. I also forgot the optimal approach. Many people did. So, don’t worry, these are rare qns, i know they demotivate, but let’s rise up and keep going ❤️❤️❤️ This qn is indeed wierd. But the explanation will make you love this qn I hope you like it.

[@danishsaifi1038]

@@codestorywithMIK loved the explanation totalKamai & totalKharch.❤❤

[@codestorywithMIK]

Thanks a lotttttt Danish ❤️❤️❤️

[@Shivam-tu3lb]

Sir circle check m doubt hai please provide why we do not need to iterate complete circle in greedy

[@mohammedwaseem8599]

The reason why optimized approach works is bcz it is said in question tht if solution exist then it will have unique index not multiple index.

[@codestorywithMIK]

Indeed 💯

[@prathamjiwnani6419]

why we are not checking for last index in optimised solution. I mean that can also be a possible answer?

[@anmolverma075]

Here's the JAVA GREEDY SOLUTION - class Solution { public int canCompleteCircuit(int[] gas, int[] cost) { int totalKamayi = 0 , totalKharcha = 0 , n = gas.length; for(int i = 0 ; i < n ; i++){ totalKamayi += gas[i]; totalKharcha += cost[i]; } if(totalKamayi < totalKharcha) return -1; int total = 0 , result = 0; for(int i = 0 ; i < n ; i++){ total = total + gas[i] - cost[i]; if(total < 0){ total = 0; result = i + 1; continue; } } return result; } }

[@Sakshi_Parmar]

Asa bhi to ho skta h ki jab hme end tkka result positive mila but then circular way me starting se iterate krna start kiya to negative me chala gya..please explain ki ye surety kaise h ki end tkka agr positive h to ans yahi index hoga ...

[@ajinkyakhete1151]

Best video for this question hats off ....

[@codestorywithMIK]

❤️❤️🙏🙏

[@deepikasheshsrivastava4095]

Best explanations. Thank you!

[@codestorywithMIK]

Thanks a lot 😇

[@oqant0424]

bhaiya i wanted to ask u something i am currently in 4th year.. with no internship and ab tak koi job ni lagi and utni strong resume ni hai to kahin select bhi ni ho raha... samjh ni aa raha kya karun😢 i know pahle utne ache se mehnat ni ki..........but now i am doing it😶😣

[@souravjoshi2293]

I am also in same situation brother. So, I have decided to code everyday and prepare everyday. It's never too late. All the best to you too

[@oqant0424]

@@souravjoshi2293 yes same here....what we can do is just to give our best every single day....All the best to you too! lets help each other till we reach our goal be in touch🙌

[@oqant0424]

sawal to samajh aa gaya tha ..but i was not even able come up with a brute force

[@codestorywithMIK]

No worries. That’s how we all learn and grow Always go for brute force first That’s why I discussed brute force

[@oqant0424]

@@codestorywithMIK thank u so much bhaiya........mark my words your channel will be discussed everywhere soon!

[@codestorywithMIK]

It means a lot to me ❤️❤️❤️ Hope the day comes and everyone soon starts quitting paid courses and focus on self study ❤️❤️❤️

[@oqant0424]

@@codestorywithMIK INDEED!

[@ezcoding69]

agar aisa hi koi brute force & optimize approach explain and code kre to dsa mein master hone mein jyada smay nahi lagega...thanks sir ji

[@codestorywithMIK]

❤️💪💪❤️

[@codestorywithMIK]

Thanks a lot 😇

[@AnandKumar-kz3ls]

when your total is less than 0 you set the next index as the answer how you can decide theres in between indexes where total >0 can also not produce the result

[@oqant0424]

how only checking till n-1 index ensures that it will cover the loop?

[@RG-hm2er]

Was waiting for your video! Thanks

[@nagmakhan672]

Was waiting for your explanation

[@akshhay]

Amazing explain bhai ji 🫡🙏🙏

[@codestorywithMIK]

Thanks a lot Akshay ❤️❤️❤️

[@vijayninganure2049]

Nicely explained.. 🔥🔥 Keep posting daily. It will help us to understand the concept.

[@codestorywithMIK]

Thanks Vijay ❤️❤️❤️

[@lofireverbz-wy7go]

was finding it hard to understand , but bhaiya trust me you u explained me this in one go❣❣

[@abhinavkumar1356]

Thank you brother 😊😊

[@codestorywithMIK]

Thanks for watching Abhinav ❤️❤️❤️

[@gui-codes]

MIK = LEGEND of DSA

[@kunal4710]

VERY WELL EXPLAINED 🔥🔥🔥🔥🔥🔥

[@codestorywithMIK]

Thanks a lot Kunal ❤️❤️❤️

[@souravjoshi2293]

I was waiting for your explanation. Let's get started 🔥

[@codestorywithMIK]

Hope you enjoy it!

[@molyoxide8358]

Bro I get the answer of 'WHY this?' "why not that" very clearly from your channel. Thanks a lot & already subscribed just before you changed the channel's name.

[@codestorywithMIK]

Thanks a lot ❤️❤️❤️ It means a lot 😇😇😇

[@subhodeepmaji5997]

Didn't prove why we will have solution if total_kamai > total_kharcha. Just said greedy hai, intuition se ho jata hai. Correct me if I am wrong, pura video nahi dekha.

[@codestorywithMIK]

Hi Subhodeep, This was my thought process actually. I greedily assuming that condition. May be , you can share your thought process also, I would be more than happy to explore it together Thanks a lot for watching ❤️❤️❤️

[@akshatsaxena8024]

Thanku so much for such a great explanation I really enjoyed and Its becomes very hard for me to forget 😁😁😁😁😁😁

[@codestorywithMIK]

Wow Thanks a lot Akshat ❤️❤️❤️

[@amanbalhara7365]

Very well explained, i was searching for this kind of video nd I got it , it helped alotttt. Thnku sooo much!!!! ❤️

[@codestorywithMIK]

So glad to hear. Thanks a lot Aman ❤️❤️❤️

[@wearevacationuncoverers]

I didn't find a better explanation to this video in the entire internet. You are just amazing

[@samannwaysil4412]

Wow , such explanation...

[@codestorywithMIK]

Thanks a lot 😇😇😇 Hope 1M comes soon 😃

[@udaytewary3809]

You are really sensational bhaiya while I was solving the question and not able to understand the question and just by watching you for few second I git understand the problem really well and for that I am really really thankyou bhaiya. And mark my words bhaiya you are going to create a great change in the thinking ability of ours and for this we will be always great full to you 🤗🤗🤗

[@codestorywithMIK]

Wow Thanks a lo Uday ❤️❤️❤️

[@manish6801]

I scroll through whole comment section 😀 whatever others say it's definitely true bro. You have really unique teaching stylish and lovely 😍😍. Can you please make a video on Kth smallest element in two sorted array/median of array??

[@codestorywithMIK]

Thanks a lot Manish. ❤️❤️❤️ Noted for Kth Smallest Element, Coming soon

[@nagmakhan3165]

I think this is the only indepth video on this problem 🔥🔥🔥

[@amansrivastava1360]

Awesome Bhai👍

[@codestorywithMIK]

Tysm 💝

[@atmanirbharofficialindiaon2789]

Subscribed straight away after this level of explanation from a question which was bugging me for months

[@codestorywithMIK]

Means a lot ❤️❤️❤️

[@abhinay.k]

thank you sir

[@piyushacharya7696]

Thanks a lot for mentioning me bro😎😎 If you ever wish to use that thumbnail then I can provide you the template bro. reach++++

[@codestorywithMIK]

Thanks a lot Piyush ❤️❤️❤️❤️

[@piyushacharya7696]

@@codestorywithMIK vai mein ye optimal samajh nahi paraha kaise kisi index se hum end tak pahoch gaye toh woh hi ans hai?

[@danishsaifi1038]

@@piyushacharya7696 Wo ans islie hai kuki humne pehle hi check kr liya sum of gas and sum of cost ko calculate krke agar sum of gas kabhi bhi kaam hoga to possible hi nahi hai k hum kitni bhi cost deke pura circle complete kr sake. or agar hum use case se bach gae or result_Index search krne aae hai to its means there should be an answer which going to be always present.

[@codestorywithMIK]

Correct 💯

[@piyushacharya7696]

​@@danishsaifi1038 yeah, now I got it. Sar dard qn hai yeh sach mein😂😂

[@danianiazi8229]

I like your videos, you tell about the question history it repitation stats and its importance so who eevr are preparing might not get scared.

[@codestorywithMIK]

Thanks a lot Dania 😊

[@pranaymishra5456]

face revealed at 2:20

[@anmolverma075]

Thank you sir for such a great explanation!! Was able to code the greedy solution by myself after you explained. Most underrated gem on YT.

[@sanjaykatta6499]

It has some (very very small) similarities with Kadane's algorithm - as soon as we are running out of fuel (ending with net zero fuel), we are discarding it and starting with the whole new index.

[@vishalplayzz2580]

i dint do this :/

[@codestorywithMIK]

Now you can 😇❤️😊💪💪💪💪 Let’s watch the video and learn 💪💪💪

[@alphadrones23]

awesome... skip karne ka mann hi nai karta.....

[@codestorywithMIK]

Thanks a lot Akhil ❤️❤️❤️

[@manish6801]

Even i lost in story 😃😃

[@deepankar9964]

God level

[@codestorywithMIK]

❤️❤️❤️💪💪💪

[@OtakRajCodes]

Your explanation is top notch . also love that u explain both brute force and greedy solution

[@codestorywithMIK]

Thanks a lot Raj ❤️❤️❤️

[@YashSinghal]

question was soo confusing but your solution was amazing

[@codestorywithMIK]

Thanks a lot Yash ❤️❤️❤️

[@harshdiwan9283]

Superb♥. Maza aa gya bhai

[@codestorywithMIK]

Thanks a lot Harsh ❤️❤️❤️

[@harshdiwan9283]

@@codestorywithMIK bhai in place of accumulate what we can use in Java ?

[@codestorywithMIK]

Hi Harsh, i think there is no such shortcut in java. I am also not too well aware of java. If i get to know , i will share for sure

[@shashankshandilya1517]

Thank You for the Explanation

[@codestorywithMIK]

I am glad it helped ❤️❤️❤️

[@prashantsharma2569]

Nahi milega koi inke jaisa jao aajma lo🥹🥹🥹 Lots of respect sir🙏🏼🙏🏼🙏🏼🙏🏼🥹

[@parishjain4705]

no words how amazing you are

[@molyoxide8358]

Bro Udemy pe koi CP se realated course hai kya??

[@codestorywithMIK]

Hey, Sorry I am not aware of this. May be you can try searching on Quora or google, someone might have answers