| Название | : | Total Unique Ways To Make Change - Dynamic Programming ("Coin Change 2" on LeetCode) |
| Продолжительность | : | 11.42 |
| Дата публикации | : | |
| Просмотров | : | 150 rb |
 |
Table of Contents:brbrAddressing Temporal Circumstances 0:00 - 0:11brThe Problem Introduction 0:11 - 1:30brOutlining Our Subproblems 1:30 - 2:50brDefining Our Base Cases 2:50 - 3:45brEstablishing Our Subproblem Relationship 3:45 - 4:31brWe Are Ready: Filling Out The DP Table 4:31 - 10:28brTime Complexity 10:28 - 10:40brSpace Complexity 10:40 - 11:10brWrap Up 11:10 - 11:23brbrThe code for this problem is in the description Fully commented for teaching purposes Comment from : Back To Back SWE |
 |
yeah I give up trying to understand and solve this question Comment from : amerigo_wespuczi |
 |
amazing how well you teach!! Thanks for great work you do! Comment from : Allan Kong |
 |
Knowing a concept is one thing, but being able to explain it so well is another Your explanations are lucid and very easy to understad Comment from : Siddharth Khandelwal |
 |
Thanks mate you are the best! Very easy to understand! Comment from : jacob zak |
 |
But why do you use table[row][col-coins[row-1]] when table[row][col-coins] serves the same purpose? Comment from : JRED |
 |
Great video man!!! I loved the way you focussed on making everyone understand the subproblem first rather than just filling the table Btw does Tushar Roy know he is used like a meme here :P? Comment from : Aayushi Khandelwal |
 |
One of the most clear and thoughtful explanations on the subject, thank you for spreading your knowledge, you are an excellent prof! Comment from : - Ali |
 |
Really love how concise and informative this video is! Instead of getting straight into coding, thank you for drawing out the table and helping us reason through it in a way that actually makes sense and is succinct! Comment from : Helen |
 |
absolute heat Comment from : ToastySofa |
 |
Love your videos! Very easy to understand! Thank you! Comment from : Daniele Boscolo |
 |
Nah, not clear at all Comment from : Vitalii Kozlovskyi |
 |
You have made these problems soooooo easy to understand!!! Comment from : Yiyi LIU |
 |
great video Comment from : mohamedAmine rg |
 |
Best explanation Clear, concise Thanks 👍 Comment from : Azhar Khan |
 |
This explaination is damn genius! Love it! Comment from : Neil Jia |
 |
I love how you explain this problem and the use of the disclaimer "do not memorize the patter, memorize the subproblem" Your order of explanation, repetition, knowledge of the subject, the thoroughness of your explanation and your enthusiasm are amazing! Thank you for creating this! Comment from : eric einerson |
 |
Thanks for the video !! it really helped Comment from : Joshith Murthy |
 |
8:25 why subtract the coin value to go back to the row number? This is unclear Why does this work Comment from : John Hammer |
 |
THIS IS THE BEST DP PROBLEM EXPLANATION EVER THANKS! Comment from : Ruzaik Rafeek |
 |
God bless you for this clear explanation I was struggling for hours Comment from : Markov Chains |
 |
thank you this video made everything clear for me Comment from : Simona Nikolova |
 |
I pause the video at 4:23 and think for a moment which helps me to understand the solution better Comment from : Wilson Wang |
 |
Tushar Cameo though haha Comment from : Raja Ganji |
 |
thx bro! you've helped me a lot! I was struggling to understand this problem quite a long time Goood work! Comment from : 찌요 |
 |
Every single dynamic programming video should write out the underlying recurrence relation Comment from : Raisul Ahsan |
 |
I might be missing something obvious but why does coin change need a dp[] and coin change 2 need a dp[][] How do we determine when we need a 1D array vs a 2D array Comment from : Praveen Banthia |
 |
You are a fabulous teacher, crystal clear, thank you so much! Comment from : Claire Boitet |
 |
Why would you put 1 for emptyvarray? That is voodoo black Magic trial and errorbr I started with recursion memorization and looked at the numbers generated by that and tried to put relation It dies not work unless you put 1 for empty array situational and when it works we comevup with some explanation as to why 1 shod be there for nothing If 0 had worked foempty we could justify that also Comment from : Chess Master |
 |
You are the GOAT Comment from : chahalpawanpreet |
 |
Got the algo concept in ur video after failed attempts in understanding the same in two different videosThat said, u r clearer to me Comment from : silambarasans Sethu |
 |
listening to the words of a wise man can be superior to studying ten years of books br聽君一席話，勝讀十年書。 Comment from : Q Lucky |
 |
thanks for the explanation Comment from : kaushelendra singh |
 |
very well explained 👍 Comment from : Nitin Vig |
 |
Thanks for the nice explanation 💯 Comment from : Krishna Kshirsagar |
 |
Hi Benyam! I love your videos, I've been watching all of your dynamic programming problems! Thank you for the wonderful contentbrbrHowever I do have a question, in this example you chose the number of ways we can make change using [1],[1,2] and [1,2,5] coins But what is stopping using from using any other combination such as [1,5] or [2,5] or just [5] or just[2] Are they already being covered somehow? Can I choose any three combinations? Comment from : Utkarsh Saboo |
 |
Hi bro can you code in Java or Java 8 Comment from : Ravikumar |
 |
I struggle to understand iterative approaches towards dp problems your video was great help! thanks ben! Comment from : A K |
 |
This is good I believe it is also helpful for solving the different ways to represent N as a sum of K non-zero integers Comment from : James Hizon |
 |
Alpha male explanation Comment from : zenek1290 |
 |
I needed to watch this video like over and over and over and read about dynamic programming again Comment from : EKEMINI BASSEY |
 |
Am I like the only one who thinks this is totally stupid? I understand 2nd grad mathematics but not dynamic programming Comment from : Parker Perry |
 |
God bless this man for his videos Comment from : David Guo |
 |
Wow ! finally someone explained how the tabular method works Thanks :)<3 Comment from : Ashutosh Yadav |
 |
THE BEST explanation I've seen ! Awesome ! Comment from : Akash Kirthik |
 |
¥€$ Comment from : First Last |
 |
Amazing Tutorial Comment from : gautham ambethkar |
 |
I love the way how he is teaching :Dthank you Comment from : Vartika Singhania |
 |
You are saving my time of solving this problem by myself! Thank you ^^ Comment from : Azzochie |
 |
The life-coach tone in this video is giving me serious anxiety Great explanation, but I feel like I am being pep-talked for war :/ Comment from : Rohit Mujumdar |
 |
"Every single dynamic programming video should start out with the explanation of the subproblembrThis is not about table behind me It’s about subproblem and how they relate to each other" brLove this! Comment from : Thein Htike Aung |
 |
that problem is really complicated Comment from : tati tati |
 |
can i get the code also in python Comment from : chaitanya pavan kumar kothamasu |
 |
Thanks a lot for your videos Ben! I can see the subproblems in many DPs now! Comment from : deepa balasundaram |
 |
Thank you so much!! Love from India Comment from : Nishant Mittal |
 |
Best explanation I found about this Coin Change problem, focusing on the subproblem awesome! ❤️ Comment from : Tiago Stutz |
 |
I love the way you explain stuffs so easily I was way too confused with this approach before watching this video :) Love ya!! Comment from : Lavanya M |
 |
I find your problem explanations easy to follow Can you please add video for word break problem ? Comment from : Anagha KR |
 |
great explanation but you have to calm a bit too much energy for me, almost got a panic attack Comment from : evyatar weiss |
 |
This is why I love youtube, a person overseas just helped me understand a very crucial technique of dp Thank You sir, Keep making such awesome videos! Comment from : Tanmay Malhotra |
 |
Boom I'm lost dynamic programming breaking ma balls here Comment from : Ugo Nwachuku |
 |
I've looked at a bunch of explanations for how to solve this Yours is by far the best explanation Comment from : Craig Anderson |
 |
A great way of explaination! Comment from : Pradeep Pradyumna |
 |
haha ive watched your coin change problems probably like 10x now Idk i keep forgetting the method behind the madness Thank you so much for making these videos though :) As a non commsci major, I''m super grateful you're making these videos! -headed into my google phone screen tmr Comment from : Edmund Chan |
 |
How to understand which two parameters to choose for the 2d mat or will it be a 1d or 2d matrix ? Comment from : Soumyadipta Banerjee |
 |
Most helpful explanation Thanks a lot Comment from : anju maurya |
 |
Thanks G Comment from : EinstienJr |
 |
OMG this is the best explanation!! Thank you! Comment from : Irene Li |
 |
the base case doesn't make any sense to me, if I have [ $0, $1, $2, or $5] , I have one solution to make zero total can anybody explain or rephrase it for me? Comment from : Mohamed Abdelhalim |
 |
I just Have a doubt here is it possible to return all the possible combinations in a list using this dp approach? Can anyone help me with this? Comment from : Ramachandra Gopal Posina |
 |
Damn it! I cannot like twice! Comment from : nelsonthekinger |
 |
Is it a bot that liked all the replies! Comment from : Prakhar Shukla |
 |
I have recommended all of my friends who wanted to learn dp this channelHis shear passion and excitement to teach itself crystal clears all the concepts and doubtsand of course he taught me to think about subproblemsThank you for this wonderful explanation!!!! Comment from : Amit Purohit |
 |
I watched many videos on this problem, This one solved all my doubts Very greatly explained Thanks a lot!!! Comment from : Rashmitha Ravi |
 |
Thanks man Comment from : Hidaya |
 |
Every video is so clear! Comment from : Zhao Wencheng |
 |
Couldn't have explained it betterrespect man! Comment from : MAZHAR ALI BAIG |
 |
You are frickinn legend!!!!!! Comment from : ROboHaul |
 |
This is much better than Tushar's video in terms of explanation, I think the explanation of using and not using the coin in the list on each step makes way more sense Comment from : Shrimat Kapoor |
 |
Magnificent explanation!brSir,keep it up! Comment from : Akshit |
 |
Bravo super clean explanation, one note I think for [] 0 - we can set it as 0 and it will make more sense Comment from : Sk Iv |
 |
Great explanation! Thank you Comment from : Umut Zafer Ersoy |
 |
This video consists of 2 videos brhow?br1) 0:58 - 1:01 --Tushar's whole Coin Change video 🤣br2) rest is this guy's video brjokes apart Tushar is also awesome too Comment from : Ganapati Biswas |
 |
clear Comment from : Jarvis Celsius |
 |
Best teacher superb explanation Comment from : Suthakar K |
 |
This is such a clear explanationthanks a lot The best video on coin combinations explanation👍 Comment from : Dhara |
 |
bottom up approaches are so unintuitive Comment from : Goku Kakarot |
 |
15. Coin Change. Unique Ways. (Dynamic Programming for Beginners) РѕС‚ : Andrey Grehov Download Full Episodes | The Most Watched videos of all time |
 |
Coin Change - Dynamic Programming Bottom Up - Leetcode 322 РѕС‚ : NeetCode Download Full Episodes | The Most Watched videos of all time |
 |
Dynamic Programming ?| Coin Change Problem Leetcode | C++ | Java | DSA-One Course #86 РѕС‚ : Anuj Bhaiya Download Full Episodes | The Most Watched videos of all time |
 |
Coin Change 2 - Dynamic Programming Unbounded Knapsack - Leetcode 518 - Python РѕС‚ : NeetCode Download Full Episodes | The Most Watched videos of all time |
 |
Coin Change 2 | Dynamic programming | Leetcode #518 РѕС‚ : Techdose Download Full Episodes | The Most Watched videos of all time |
 |
Coin Change Problem | Dynamic Programming | Leetcode #322 | Unbounded Knapsack РѕС‚ : Techdose 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 Change Permutations Problem Dynamic Programming | Total Number of Ways to Get Amount РѕС‚ : Pepcoding 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 |
 |
Coin Changing Number of ways to get total dynamic programming РѕС‚ : Tushar Roy - Coding Made Simple Download Full Episodes | The Most Watched videos of all time |
