Название | : | Coin Changing Number of ways to get total dynamic programming |
Продолжительность | : | 6.26 |
Дата публикации | : | |
Просмотров | : | 177 rb |
|
2022_06_27 Comment from : JockyItch |
|
This is a pretty terrible explanation Too many gaps Comment from : jdkhamba |
|
Very clear People disliking it should not do programming Comment from : snake3276120 |
|
Leetcode Problem: 518 Comment from : Vignesh Kavattur |
|
This is so confusing 🤣 even he doesn't know what he's doing Comment from : Sanjeev Singh |
|
is there any recursion solution for this if it is there please put sir Comment from : Kushwanth Kapa |
|
For anyone reading this comment, please try and learn how we come up with these solutions Don't mug it up like the guy in the video The solution is actually very intuitive and once you understand WHY this works, you will never forget it and will be able to solve other questions that are similar to this one Comment from : Alokesh Bora |
|
Python Solution:br idegeeksforgeeksorg/PuDqeriAMY Comment from : Nikhil Singh |
|
how can we get a total of 0 in 1 way ? Comment from : Ganapati Biswas |
|
Thank god I skipped the whole video and just wasted 20 seconds and the time to put a comment for the greater good Comment from : fake account |
|
Let's fill this column with 0, let's fill this column with 1that tells everything about the lecture No intuition, no logic only ratttta Comment from : SAURABH VERMA |
|
2:12🤣🤣🤣🤣 he doesnt know why he is doing this🤣🤣 Comment from : CodeBlooded |
|
this is irritating! Comment from : Rishabh Ratan |
|
Its just like he has mugged up all the algorithm before this video and just gulped out whole in front of camera Comment from : TANMAY AGARWAL |
|
He explained how the algorithm works, but he didn't explain how one can come up with such tabular solution Promotes memorization rather than analysis Comment from : Nilkin TV |
|
i might be wrong but let me take a stab at it if i want to solve the very last cell which is the last row and column, i think it is saying that we know how to get 5 from the other 2 coins and that answer is 3 ways to get 5 from just the other 2 coins now we still have to add how many ways we can get to 5 using the third coin as well so we know that the last coin has a value of 3 what is the amount we need to get from the value of the coin which is 3 to the total we want which is 5 that answer is 2 we need to find out how many different ways can we make 2 using the last coin in order to reach the final total of 5 therefore we back into it by taking the total of 5 minus the value of the last coin 3 to get the amount we need which is 2 and we can see that there are 2 ways for us to make 2 so we add that 2 to the other ways we made 5 with the other coins thus the final answer is 3 ways to make 5 using the other 2 coins plus 2 ways to make 2 using all the coins brings us to the final answer of 5 ways to make 5 using all the coins the reason we don't have to find other ways is because we already solved the overlapping subproblems so they are already included in our final answer sorry if this doesnt make any sense to you, but writing this comment actually helped me understand it better, lol peace out Comment from : ian senior |
|
make more videos nice explanation Comment from : mohit singh |
![]() |
Coin Change Permutations Problem Dynamic Programming | Total Number of Ways to Get Amount РѕС‚ : Pepcoding Download Full Episodes | The Most Watched videos of all time |
![]() |
Find total number of ways|Coin change problem|Dynamic Programming|Bangla Tutorial РѕС‚ : Farhan Hossan Download Full Episodes | The Most Watched videos of all time |
![]() |
Coin Changing Minimum Number of Coins Dynamic programming РѕС‚ : Tushar Roy - Coding Made Simple Download Full Episodes | The Most Watched videos of all time |
![]() |
dynamic amoled 2x | dynamic amoled 2x vs dynamic amoled | dynamic amoled 2x 120hz hdr10+ РѕС‚ : Tech Duggar Download Full Episodes | The Most Watched videos of all time |
![]() |
Total Unique Ways To Make Change - Dynamic Programming ("Coin Change 2" on LeetCode) РѕС‚ : Back To Back SWE Download Full Episodes | The Most Watched videos of all time |
![]() |
Knapsack Problem using Dynamic Programming Part I | Dynamic Programming | Lec 65 | DAA РѕС‚ : CSE Guru Download Full Episodes | The Most Watched videos of all time |
![]() |
Coin Change Combination Problem Dynamic Programming Explained | Coin Change Minimum Number of Coins РѕС‚ : Pepcoding Download Full Episodes | The Most Watched videos of all time |
![]() |
15. Coin Change. Unique Ways. (Dynamic Programming for Beginners) РѕС‚ : Andrey Grehov Download Full Episodes | The Most Watched videos of all time |
![]() |
Procedure Oriented Programming and Object Oriented Programming - Java Programming Tutorial РѕС‚ : Ekeeda Download Full Episodes | The Most Watched videos of all time |
![]() |
Free Credit Card Number MM/YY CVC | Get Credit Card Number mm/yy cvc in 2023 РѕС‚ : RoladEL Business Download Full Episodes | The Most Watched videos of all time |