I compared a few videos plus my proffessor explaination, I have to admit this one was by far the best. I wish our instructors could explain these clearly. Thank you
Best explanation ever. Most of the youtubers only fill a dp table without explaining why s/he excluding a cell or row but he did it very easily. Thanks a lot.
I just understood the 0/1 knapsack after watching your way of solving the problem. thankyou for teaching in a very easy manner, please continue to make such useful videos.
I watched more then 5 videos but could not understand anything. I was so frustrated but then I came across this video which cleared my all doubts and helped me in understanding the concept. Thankyou so much Sir. 😇
I noticed that your original profit in the problem statement does not match with what is used in matrix. in the example you specified the profit were 2, 5, 7, 8 respectively on your left side, but when you compute the matrix your profit is values are 2,5, 9, 6.
This problem is similar as unbounded knapsack problem. This problem is also be implemented with 1d array. Both time complexity are Big O of n*m where n is total weight and m is the number of pieces.
Is the maximum number of cuts in any scenario using this algorithm, 2 cuts? Because that's what it is in this video. Just curious if it's always that way
one of the best explanations in dynamic programming I had seen so far.Thanks a lot sir😊
I compared a few videos plus my proffessor explaination, I have to admit this one was by far the best. I wish our instructors could explain these clearly. Thank you
Best explanation ever. Most of the youtubers only fill a dp table without explaining why s/he excluding a cell or row but he did it very easily. Thanks a lot.
I must admit that your videos are of high quality and you are just great for making these available at no cost. Thank you very much! Keep it up. :)
I just understood the 0/1 knapsack after watching your way of solving the problem.
thankyou for teaching in a very easy manner, please continue to make such useful videos.
Finally, someone explained DP in understandable human language. Thank you!
I watched more then 5 videos but could not understand anything. I was so frustrated but then I came across this video which cleared my all doubts and helped me in understanding the concept. Thankyou so much Sir. 😇
the best explanation so far on UA-cam for this problem
Best explanation on this entire planet !
I noticed that your original profit in the problem statement does not match with what is used in matrix. in the example you specified the profit were 2, 5, 7, 8 respectively on your left side, but when you compute the matrix your profit is values are 2,5, 9, 6.
but that is not making any difference right.
This is the best video on this topic. Thank you so much!
Thanks a lot, man. Saw almost 5 video solutions till now and didn't get a thing. You rock \m/
the most informative video on DP I've seen!
Crystal clear explanation:)Thank you so much sir!!!
Vivekanand please keep making such detailed explanatory videos
sir plz upload more ,dont stop making such great videos
Each step of the bottom-up DP algorithm should also be explained, along with the dry run of the algorithm. Overall it's a good explanation.
Oh my goodness you are a life saver! Thanks a lot.
Thank u so much..u explained this problem in such an easy way
simply awesome sir !! U have made dp so easy to understand!!! Wish u more subscriptions and likes to your videos !!
Amazing video.
Was of a great Help.Thanks a ton for upload.
Great Explanation Sir!
Nice explanation.
Really appreciate your efforts.
literally the most informative video I've seen! thxs
you have to watch more videos.
you explained it very well...please keep making more such videos. I have a question - can we build the solution using 1-D array?
excellent way of explanation. Thanks
Excellent and precise explanation.
I love your explanation i wish you could do more DP problems like reg exp matching
Your explanation is awesome as well as your laugh... 😝
Luv you sir you made it very easy keep uploading videos.we are waiting desperately
This problem is similar as unbounded knapsack problem.
This problem is also be implemented with 1d array.
Both time complexity are Big O of n*m
where n is total weight and m is the number of pieces.
Thank you very much. I finally got it!!!
1d cut optimization formula excel me bana sakate he kya
Never understood dp until now.. thanks a lot
Is the maximum number of cuts in any scenario using this algorithm, 2 cuts? Because that's what it is in this video. Just curious if it's always that way
ThankYou so much for such an awesome explanation :)
Thank you sir. Amazing
excellent video vai ! i felt much difficulty to understand DP! your explaination makes dp so easy ! please also add code in your videos! :
Nice teaching sir
6:42 confusing it should be
it is not possible to make a rod of length 1 with pieces of length 2.
but Explanation is really helpful.
Use recursive strategy and store results in map to make it optimise.
But why does this formula work?
why are you using a 2D matrix when there is a solution using a 1D vector?
To explain the solution to you!
that uses a recursion! so internally another stack will be made
Great video sir.Thanks...
thank you so much, you are so good.
Nice explanation
awesome explanation
thankyou very much sir for explaining
Great explanation...Made it simple :)
Thanks Tarun..!1
thanks for the nice explanation.
Thank you .Please explain optimal revenue
Easy to understand.Thanks
very good explanation
Thank you sir, understood. And please make video on matrix chain multiplication
Yes sure...will make the video.
very nice video . Please explain with code.
This guy is awesome❤
hes the perfect example of indian guy teaching on UA-cam meme ♥️
man u just made me subscrib.....
Awesome expalnation...Please upload Mancher's Algorithm
whuy does everyone strt filling the matrix to explain dp...DP is way more than manually filling matrices.
sir, please upload 3 4 more dynamic problem question it is very much helpful in understanding how to solve dp.Once again thank you very much sir.
Yes sure Aditya..!
Awesome explanation, please spend some time to take through pseudo code also.
code ?
Hi Can you please add the code also and traverse us through the code.
yes will make the video with the code..!
@@vivekanandkhyade Hi, can you please upload the video for the code.
it would be great if you provide us with code also
Good explaination! (y)
Sir please make a video solving this question-Largest subarray with equal number of 0s and 1s.
I am able to do it in O(n^2) complexity
is already very clear if only look at the board
listen in speed 2x
why sanju
Thanks for the video :)
sir make videos more on dynamic programming
nice lesson
Very helpful
Wonderful.
legend
Thanks a lot.
thank you. good one..
your answer is worng
Thanks
you r the best though i speed the video but its too good
this can be done by greedy method
plz youtube, give us a 3x button
code ??. not useful without code.
Nice
aapla manus ..
nice
great
24:22 😄
O slow motion :D
Bro is an internet explorer 😭
god
worst explanation ever
To much boring lecture