The way you first show the brute force and then optimise it is really helpful to understand the whole process.. everyone should give a moment to appreciate your work.. love from INDIA..
I have looked at many solutions to this problem. No one ever explained why this solution works. This is the first time I actually understood why it works. This video is just gold.
Great vid! I was wondering why the view count and subscriber count was so low considering this is an amazing explanation for this problem, esp considering some of the other ones, but then I noticed it's a recent vid and channel. Subbed, keep up the good work. It's nice being an early sub to a channel that uk will get big in no time
Hi, sorry I'm really busy with interviewing myself actually and thus the delays. I am to hoping to deploy the site early to mid November. Thanks for watching my content and I'm glad you found it useful!
In your last example (9min51sec), let's label the gas station [0, 1, 2, 3, 4, 5, 6, 7], if you find the starting point to be 5, how do you make sure the car can make its way back from 0 to 5?
Great explanation brother. Clicked me in one time only. Wow, nice. It took me hours to figure out and then I got to see your video and it just helped me in less than 10 minutes. Thank you for sharing this. Keep up the great work.
bro , a small suggestion from my side. why can't change the name of the channel. "cracking coding interview problems" , "Algorithms and ideas for interview prep " . These are few suggestions. The appropriate name might attract the enthusiastic learners. This channel should be know for all preparing for coding interviews.
But this name sounds quite cool, knapsack is an inseparable part of any ds algo enthusiast😉, so I guess everyone can relate this name with the contents of this channel
The way you first show the brute force and then optimise it is really helpful to understand the whole process.. everyone should give a moment to appreciate your work.. love from INDIA..
I have looked at many solutions to this problem. No one ever explained why this solution works.
This is the first time I actually understood why it works. This video is just gold.
Great vid! I was wondering why the view count and subscriber count was so low considering this is an amazing explanation for this problem, esp considering some of the other ones, but then I noticed it's a recent vid and channel. Subbed, keep up the good work. It's nice being an early sub to a channel that uk will get big in no time
The best explanation I've watched. Very complete reasoning process, answers all my questions
What a great explanation man. Appreciate a lot. Your subscribers count and your teaching ability dont match. Keep making videos.
Best solution of this problem so far
Had to watch the improved algorithm explanation multiple times but now I finally understand! Great video, thanks!
That is THE BEST explanation I ever get for this question. Thank you!
The best explanation yet for this problem! thanks
Great Great Great.......................explanation
thank u sir ................
Beginners like me need this kind of more videos...............
This is just really amazing! The video description helps a lot. Thank you and keep making more!
I will!
I will!
Gr8 Explaination!!! Please continue this series!!!
Thanks for the detailed explanation here! Please make more videos like this!!!!
this is the best explanation for this problem!
This is the best explanation for this problem!! Keep up the good work! : )
man you are fricking amaInggg, cleared all doubts
Thanks for the explanation!
amazing explanation, you solved every doubt that i had about this solution and i was convinced about the solution at the end. Thanks
Great explanation!
What a beautiful explanation!
shldn't u do start = (i + 1) % gallons.size() ? to avoid crossing the array boundaries ?
Beautiful.What's your website or github details you mentioned for the code.
great explaination..and animation makes its easy to grab.
Just amazing! You explained it beautifully!
I dont know why this video has only 11 k views.. Should have been atleast 10^5 views .
You are awesome! Your videos are top-notch.
This is a very expensive coding challenge considering current gas prices
awesome content!!!!
Keep doing ...this.....ur good in this.
Excellent
you got yourself a new subscriber ! Your explain is great
Great explanation of the problem.
Big Thank you !! I finally understand why the algo works, phew !!
Hey! Did you go ahead and launch this website, I'd love to see more content, it's truly amazing, where can I find more content?
Hi, sorry I'm really busy with interviewing myself actually and thus the delays. I am to hoping to deploy the site early to mid November. Thanks for watching my content and I'm glad you found it useful!
Great videos and explanations!
Nice work bro, thanks
Thank You! Thank You! Thank You! I can finally die in peace.
Thank you very much!! Great explanation!
great explanation, you earned a subscriber.
Pure Gold !!!
Sir can you once check this for the input gas : [2,3,4,5] and cost : [2,1,4,3] I am getting answer as index 0 but I need to get 2 index as output
Beautiful explanation. Subbed!
Can we sort the indexes based on (Gas[i] - Cost[i]) ? Will this work ?
Thank you very much
Great Explanation
Ur videos are awesome pls post more videos
Great explanation! Thank you
In your last example (9min51sec), let's label the gas station [0, 1, 2, 3, 4, 5, 6, 7], if you find the starting point to be 5, how do you make sure the car can make its way back from 0 to 5?
Use while loop
Thanks a lot!!!
Very helpful!
Amazing explanation
Thank you! Finally I can die in peace.
Great explanation brother. Clicked me in one time only. Wow, nice. It took me hours to figure out and then I got to see your video and it just helped me in less than 10 minutes. Thank you for sharing this. Keep up the great work.
Thank you! Glad the explanation helped!
good explanation
I saw many videos on this problem, but none of them are as simple as this one
Thank you for the great video. I really love your explanations. Is there any chance you could do snakes and ladders from leetcode?
I have a few other videos planned right now, but I'll definitely take a look at it and make a video about it in the future!
@@KnapsackLabs thanks!!
Can you explain the optimal solution a little better?
Awesome
thanks!
such a nice video
bro , a small suggestion from my side. why can't change the name of the channel. "cracking coding interview problems" , "Algorithms and ideas for interview prep " . These are few suggestions. The appropriate name might attract the enthusiastic learners. This channel should be know for all preparing for coding interviews.
Hello, thank you for the suggestion, I will certainly take it into consideration!
But this name sounds quite cool, knapsack is an inseparable part of any ds algo enthusiast😉, so I guess everyone can relate this name with the contents of this channel
excellent explanation but you speak tooo fast
Beauty