Nice explanation of the concept. Keep doing more such videos. ❤ However, just wanted to add a small detail here (in favour of others checking as well). It would be good if we could also initialise minCoinsDp[0] to 0 explicitly. As to reach amount 0, fewest number of coins is 0. Since its java code, I think it gets initialised automatically to 0, but for other primitive languages like c,c++ we need an initialiser and the loop in the example code is only running from i=1 (skipping 0). vector minCoinsDp(amount+1, INT_MAX); // default initialise all to INT_MAX minCoinsDp[0]=0; // special case If the code can be adjusted as above, all such ambiguity can be cleared.
Amazing visualisation of the problem which helped me clearly understand the solution. Please continue doing your explanation with visualisations, they're extremely helpful
Listen, your explanation for this f**king question is the best online! Let's put aside the fact that you'll never need this in a real job, but for job interviews, this specific explanation is the best-much better than Neetcode
Your explanation is awesome sir.. but during that dry run code i was little confused...i was expecting u to tell about the for loop using some dry run....That was just my opinion..
I understand...but I realized that the video already went too long, going over each step in the code would take another 10 minutes. If you follow the logic as explained, writing the for loop should not be tricky at all. What part of the loop are you facing a problem with? I can elaborate more as needed :)
@@nikoo28 could you please explain the loop where you look through the coins and what exactly you are doing? I'm a little new to DP and I understand the solution but the implementation is a little fuzzy.
Sorry if you felt that way...but I want to focus my channel on understanding the problem rather than writing code. I believe that if you have good problem solving skills, writing code is very trivial. There are a lot more channels who do a better job at writing the code :)
Always remember that languages will continue to change and evolve with time. The concept and the logic will remain forever the same. :) So, in order to become a better coder, I would highly recommend you to try writing the code on your own. 😃 If you are still interested to know how the code is working, use a debugger and iterate through the values. This way you will always be a better leaner.
Sir , I started watching your lecture series. I am able to understand very well but sometimes it is bit difficult to understand the coding part even though we understood the theory. Sir ,no one can beat u in the explanation of the theory. Spend some more time to explain code. It is reallly useful for us..I suggested my friends to watch this series..very useful series I say.❤
the thing is that today you have a lot of GPTs that can write the code for you. writing code in any language is no longer a challenge in my opinion. However, problem solving is and will always be the most important aspect. If you are understanding the solution correctly step by step, you will be able to write the code eventually. It is just a matter of time. To get the best learning, I would highly encourage you to write the code yourself, do not copy the provided code. :) All the very best for your goals!!
great explanationn my brother just wish you would've gone through the if condition you have in the last part, because I know it gets the min, but I wanted to see it explained how
yes, it can be solved. And it is straightforward If you write the recursive code first then you can memoize it or write the bottom up using the recurrence.
it is hard to explain line by line...everyone has a different coding style. If you understand the explanation, you should try to write the solution on your own.
a brute force approach would involve generating all possible combinations of coins to find the minimum number of coins needed to make up the target amount. public int coinChange(int[] coins, int amount) { int result = backtrack(coins, amount); return (result == Integer.MAX_VALUE) ? -1 : result; } private int backtrack(int[] coins, int remainingAmount) { if (remainingAmount == 0) { return 0; } if (remainingAmount < 0) { return Integer.MAX_VALUE; // Return a large value to indicate invalid solution } int minCoins = Integer.MAX_VALUE; for (int coin : coins) { int subproblemResult = backtrack(coins, remainingAmount - coin); minCoins = Math.min(minCoins, subproblemResult + 1); } return minCoins; }
I struggled for the whole day to be able to solve this problem. I could write the code by myself after watching how to fill in the array. One request - Can you make a video of solving the same problem using recursion?
@@nikoo28 No Sir please make a video on recursion your teaching level is just wow understand all dp problem but unable to understand a recursion its request sir to make video on it.
@@nikoo28 Sir because i want from brute force to space optimization and tbh i didn't understand the concept of recursion i have solve approx 30 to 35 question on recursion but i didn't get it and the way you solve this problem is phenomenon . So if u use some sort of recursion explanation in between the lecture . That will be great
Sir , im struggling to come up with dp solutions for a questions.so initially im solving with recursion and then memoizing and then converting it into dp. Is it ok or shoul i change my approach ?❤
it is a very good approach indeed if you can think with all different methods. Will often lead you to the best choice. Your approach is correct. With practice you will be able to identify patterns and come up with solutions naturally. All the very best.
what part of the code are you facing problems with? If you understand the solution perfectly writing the code for it should be trivial. We do exactly the same thing...using a for loop take one coin at a time and determine the minimum required. :)
Looked at neetcode's solution 3 times and didn't undertand it. Here I understand it the first time. Thank you!
because he explain top down approach
@@kartikforworkhe did bottom up also but his was too complicated to me
True, his explanation is better than neetcode's for this problem and several others.
The amount of clarity you had in your explanation is truly amazing!!
Nice explanation of the concept. Keep doing more such videos. ❤
However, just wanted to add a small detail here (in favour of others checking as well). It would be good if we could also initialise minCoinsDp[0] to 0 explicitly. As to reach amount 0, fewest number of coins is 0. Since its java code, I think it gets initialised automatically to 0, but for other primitive languages like c,c++ we need an initialiser and the loop in the example code is only running from i=1 (skipping 0).
vector minCoinsDp(amount+1, INT_MAX); // default initialise all to INT_MAX
minCoinsDp[0]=0; // special case
If the code can be adjusted as above, all such ambiguity can be cleared.
ikr? In javascript it's initialized to NaN
Gotcha, you finally made me understand that. After looking 3 different other videos and still was completely lost, thank you.
Amazing visualisation of the problem which helped me clearly understand the solution. Please continue doing your explanation with visualisations, they're extremely helpful
like everyone else, this was the first explanation of this problem (and dynamic programming in general) that made any sense to me. thank you!!
Listen, your explanation for this f**king question is the best online!
Let's put aside the fact that you'll never need this in a real job, but for job interviews, this specific explanation is the best-much better than Neetcode
I was so happy whenever I search a problem on Leetcode and find your video !
Best explanation ever! I was really struggling with this one. Big thank-you to you sir!
Dude you deserve more subscribers
Wonderful explanation
Great explanation, thank you very much for making DP so easy.
Thank you so much for explaining the concept .
Cleanest solution I could find for this problem. Thank you !
Great to hear!
Thanks Nikhil, well explained. I felt quick discussion of how code works with the test data would have been more helpful
Gone through so many other video solutions but understood nothing. This is the best explanation ever for this question!!
Great intention and good patience in explaining the approach. Kudos 🎉
thanks for the support..will keep making more videos.
Great explanation with amazing clear drawings. Thanks.
Your way of explaining is excellent sir..
underated youtuber , u deserve views in millions brother
Fully understand this problem now- I would say the stairs claiming is also a good one to check if you stuck here
Yes, that is a similar one
Your explanation is awesome sir.. but during that dry run code i was little confused...i was expecting u to tell about the for loop using some dry run....That was just my opinion..
I understand...but I realized that the video already went too long, going over each step in the code would take another 10 minutes.
If you follow the logic as explained, writing the for loop should not be tricky at all. What part of the loop are you facing a problem with? I can elaborate more as needed :)
@@nikoo28 could you please explain the loop where you look through the coins and what exactly you are doing? I'm a little new to DP and I understand the solution but the implementation is a little fuzzy.
What part of the loop are you facing a problem with?
the code part which is the most important part isnt explained well at all.
Sorry if you felt that way...but I want to focus my channel on understanding the problem rather than writing code. I believe that if you have good problem solving skills, writing code is very trivial. There are a lot more channels who do a better job at writing the code :)
@@nikoo28means we should look other's solution instead
so rude you are
Always remember that languages will continue to change and evolve with time. The concept and the logic will remain forever the same. :)
So, in order to become a better coder, I would highly recommend you to try writing the code on your own. 😃
If you are still interested to know how the code is working, use a debugger and iterate through the values. This way you will always be a better leaner.
👯 Finally, a video to understand this method 🥳🥳🥳
Finally understood the code crystal clear
Sir , I started watching your lecture series. I am able to understand very well but sometimes it is bit difficult to understand the coding part even though we understood the theory. Sir ,no one can beat u in the explanation of the theory. Spend some more time to explain code. It is reallly useful for us..I suggested my friends to watch this series..very useful series I say.❤
the thing is that today you have a lot of GPTs that can write the code for you. writing code in any language is no longer a challenge in my opinion. However, problem solving is and will always be the most important aspect.
If you are understanding the solution correctly step by step, you will be able to write the code eventually. It is just a matter of time. To get the best learning, I would highly encourage you to write the code yourself, do not copy the provided code. :)
All the very best for your goals!!
Respect, i love iterative explanations.
Thank you so much sir for such nice explainations.
Thanks for the visualization which brings more clarity.
yep, visuals are easy to remember.
Really Good Explanation! Thankyou.
A big Thanks to you sir...bht better way se apne explain kiya..
Best explanation ever! Thank you!
great explanationn my brother just wish you would've gone through the if condition you have in the last part, because I know it gets the min, but I wanted to see it explained how
that is just comparison to get the minimum number. What are you struggling with?
Can you write a code that finds the minimum number of coins and also prints the actual coins used ?
fantastic intuition
Thanks
Can we solve this problem using 2-D DP by taking two changing variables length of array and amount????
try outlining a pseudo code/algorithm
yes, it can be solved. And it is straightforward If you write the recursive code first then you can memoize it or write the bottom up using the recurrence.
Better if explained the IF conditon inside for loop 🙂
explanation was 10/10 but you should once explain the code also using the same example line by line
it is hard to explain line by line...everyone has a different coding style. If you understand the explanation, you should try to write the solution on your own.
What would a brute force solution look like? Having a hard time visualising a bruteforce solution
a brute force approach would involve generating all possible combinations of coins to find the minimum number of coins needed to make up the target amount.
public int coinChange(int[] coins, int amount) {
int result = backtrack(coins, amount);
return (result == Integer.MAX_VALUE) ? -1 : result;
}
private int backtrack(int[] coins, int remainingAmount) {
if (remainingAmount == 0) {
return 0;
}
if (remainingAmount < 0) {
return Integer.MAX_VALUE; // Return a large value to indicate invalid solution
}
int minCoins = Integer.MAX_VALUE;
for (int coin : coins) {
int subproblemResult = backtrack(coins, remainingAmount - coin);
minCoins = Math.min(minCoins, subproblemResult + 1);
}
return minCoins;
}
cant understand the logic u coded in the code...please explain that too in step by step
Thank You sooooooooooooo much
aap nahi hote toh hamara kya hota? :D Thank you sir.
I struggled for the whole day to be able to solve this problem. I could write the code by myself after watching how to fill in the array. One request - Can you make a video of solving the same problem using recursion?
i generally tried to avoid recursion. It is very very confusing...also every recursive problem can be solved iteratively. :)
@@nikoo28 No Sir please make a video on recursion your teaching level is just wow understand all dp problem but unable to understand a recursion its request sir to make video on it.
@@harshitkumar8988 Why do you want to solve it using recursion?
@@nikoo28 Sir because i want from brute force to space optimization and tbh i didn't understand the concept of recursion i have solve approx 30 to 35 question on recursion but i didn't get it and the way you solve this problem is phenomenon . So if u use some sort of recursion explanation in between the lecture . That will be great
Sir the explanation was excellent but pls explain the code because I am not able to understand that why are we writing as the code is.
what part are you facing a problem with?
Make videos on backtracking plz 😊
great video
Hello, Can you share your studio setup ? what are the tools you use for drawing, editing?
Sure..I can elaborate more..but here was a sneak peek:
th-cam.com/users/shortsh2oCQmwvv94?feature=share
thanks bhai
Beautiful explanation bhaii..!!
It's my pleasure
Thanks for posting!
You're welcome
Coine piker gurunchi app lo vache nebaru details anga tamobola
When bro explains something it sticks forever.
Sir , im struggling to come up with dp solutions for a questions.so initially im solving with recursion and then memoizing and then converting it into dp. Is it ok or shoul i change my approach ?❤
it is a very good approach indeed if you can think with all different methods. Will often lead you to the best choice. Your approach is correct. With practice you will be able to identify patterns and come up with solutions naturally. All the very best.
@@nikoo28 thanks for reply sir❤️
sir could you please explain word break problem
i have that problem in my pipeline of videos. Will add it soon
we want full dp playlist
yes yes yes...adding more questions soon :)
Thanks!
Thanks for the support 😄
good approach, but the worst explanation of the code that you have written., please explain what does every line means after the second for loop. 🤫😕
what part of the code are you facing problems with? If you understand the solution perfectly writing the code for it should be trivial. We do exactly the same thing...using a for loop take one coin at a time and determine the minimum required. :)
Amazing
Best ❤
what is the use of putting Integer.MAX_VALUE here?
Just a sentinal value to make writing the code easier.
bekkar time waste video
What problems did you face??