| Название | : | Coin Change Combination Problem Dynamic Programming Explained | Coin Change Minimum Number of Coins |
| Продолжительность | : | 21.52 |
| Дата публикации | : | |
| Просмотров | : | 82 rb |
 |
Best explanation ❤️ Comment from : KARTICK DHALI |
 |
Great Video Comment from : Abhishek Anand |
 |
No words to describe Sumeet sirbrHe is really genius Comment from : Harsh Choudhary |
 |
Your explanation is god level Comment from : Nitish negi |
 |
Legend Comment from : UMANG BEHL |
 |
!Min No of Ways it's total no of ways Comment from : Shubham Garge |
 |
Yadhi yee Playlist hard lag rhi hai yaa smajh nahi aa rhi toh bhaiyo pepcoding ke rajnesh sir ki dp Playlist dekhlo 28 videos hai small si Comment from : SAGAR |
 |
Let us all bow down to his genius explainations! 🙌 Comment from : Abhinandan Jain |
 |
Sir in this series of of five questions (of dp taregt subset) do we have any trick to know when we will use 2d dp and when 1d dp Comment from : Ghanendra Panwar |
 |
11 with 1,2,5 me nhi chal rha hai yeleetcode me Comment from : Rajdeep Ghosh |
 |
best dp videos <3 Comment from : Shubham Mittal |
 |
Great explanation sir very perfect 🔥🔥🔥 Comment from : iPhone shoots |
 |
Sie when to use 2D dp and 1D dp? Comment from : Jay Gujarathi |
 |
sir this is not leetcode 322 problem as you have mentioned in the next video that it is leetcode 322 Comment from : shashank jain |
 |
Sir combination kaise ban rha vo confirm h but code me kaise Cal rha h isme confusion h Comment from : Nikita Kushwaha |
 |
Thanks a lot for making this video, especially in for hindi explanation Comment from : gem member |
 |
Amazing explanation So clear and detailed !! Thanks Sir for always going an extra mile to explain Comment from : Swati Satija |
 |
for the case 1,2,5 as array and target as 11 this solution gives 11 as answer but the correct answer is 3, we need to solve that edge case by taking the min at every iteration Comment from : Tanisha Gupta |
 |
thanks Comment from : Ashish Gusain |
 |
thank you sir the way you are explaining problems is easy to understand untill now i did not find a teacher like you sir thank you sir Comment from : Ayyappa Reddy |
 |
it some how doesnt click to me that combination of paying 0 is 1 I feel that it should be 0 there is no combination Comment from : kartik khatri |
 |
FANTASTIC !!! Comment from : M S Anirudh |
 |
sir combination ke value bhi print karni hoti to? Comment from : Jatin Lodhi |
 |
i dont understand why only 846 likes and 29598 views on this video all videos of pepcoding deserve much much more than this Comment from : rohan ray |
 |
thank you soo much from ❤ I'm here just for telling that I was able to solve this que without watching solution vdo Comment from : prachi |
 |
sir hum kb 2d dp array use krenge aur kb 1d??aur sir iss ques ko 2d se v kr sakte??brplzz sir reply Comment from : Raghav Code |
 |
because of following your playlist, I was able to do this question without even watching the video thank you so much sir Comment from : kushagra |
 |
I was able to code the soln just after watching five mins of the video Comment from : Animesh kumar choudhary |
 |
SIr mujhe DP samjh kar nahi aa raha h , matlab I've tried watching your videos ,concept b samjh aa raha h par maza sa nahi aa raha h jaise aur topics me aata h Kya karu sir? dp se to phobia type ka bann raha h 😣😣😣 Comment from : Shweta Gupta |
 |
Sir, truly, you are at a different level Amazing The way you taught this, I will never forget this problem Comment from : Alokesh Bora |
 |
Watching 10 video of this channel and making notes has made me 10 times better coderbrNo endorsement, this is real truth Comment from : Arvind G |
 |
isn't the title misleading? we're not finding min number of coins, we're finding in how many ways can we have the target sum Comment from : Kaushani Roy Choudhury |
 |
i was solving it with the target sum technique technique worked Comment from : fashion vella |
|
|
i was trying to solve with the very same tehnique but was not getting point Comment from : fashion vella |
 |
You are the best, by god's grace i am lucky that i found you DP playlist, because of your dry run it clears my concept really wellbr Thank You Comment from : Atish Yadav |
 |
From your video, we are actually learning, how dp is working Comment from : Rohit Negi |
 |
best, amazing, fantastic, fantabulous, extraordinary, excellent, over whelming !!! Aur bhi likhta but aur words dimaag me nhi aare Comment from : Kunal Nayak |
 |
Best explanation Sir🙏 Thanx for the gr8 content that you provide Comment from : Nik |
 |
THANKS SIR FOR THE GREAT EXPLANATION!!! KINDLY COVER Princess FARIDA DP
br QUESTION IN YOUR SERIES ,IT WOULD BE OF GREAT HELP Comment from : rana vij1993 |
 |
Explanation is great However I am confused as the solution returns the total no of combinations, but the title says minimum number of coins Comment from : Prakhar Shreshtha |
 |
Sir, please explain the dp solutions with recursion as well🙏 Comment from : Ashwin Varma |
 |
Sir, when will you solve dp problems using memoization Please tell, i am facing lot of problems in tabulation Comment from : Yash Kumar |
 |
Sir please also discuss the time complexity of these algorithms Great Content BTW !! :) Comment from : Smit Rami |
 |
👌 Comment from : Himanshu Singh |
 |
When he corrected bhaiya to behen xD Comment from : MANSI JOSHI |
 |
No words to express how great and valuable this content is 🤩 Comment from : Naman Singhal |
 |
Best explanation that i have came across so far especially for DP Comment from : ridhi agarwal |
 |
Sir I am not able to recognize when to use 2D array when not?brplease tell me some path sir Comment from : Ananya Agrawal |
 |
sir agr hum memoization approach se kare toh sir isme 2d array lena padega na ,only a yes or no sir please won't take long but would really help me to check that i am on right track Comment from : Aviral Khanduja |
|
|
Sir isme ye cheez constraint hai na ki denominations should be in inc order Comment from : Aviral Khanduja |
 |
it may be a naive question, but why we didn't use a 2d array here?? Comment from : ZtrixX |
 |
Best explanation over the YouTube Comment from : Rachit |
 |
Hands down the best explanation online Comment from : Mayank Sharma |
 |
Need to edit the title of this video a bit This doesn't calculate the minimum number of coins required for a particular sum I got confused in that but could use the explanation to tweak it to get the minimum number of coins required Comment from : Ayan Paul |
 |
Excellent Explanation 😊 Comment from : Vithlesh Kumar Gupta |
 |
sir, Your videos are really awesome I have now modified my search from "question name" to "Question name pepcoding" Thankyou Comment from : Rahul Sureka |
 |
Sir, your videos are a blessing for quick and deep understanding But you raised the stakes really high : Nagarro! Comment from : Deepak Srivastava |
 |
This video really helped me Thank you! Comment from : Pucca Episodes |
 |
Tackling DP Questions should start from generating a recursive statement and using memoization (Bottom up Approach) I personally believe tabular can be understood very well after that and why we did what we did Comment from : Play With Pinkman |
 |
4:43 abhi shyd fraud sa lgra ho😂😂 Comment from : Aditya Ojha |
 |
Recursion se karte hain toh dimagh lagana hii nahi padhta par iteration meh bahut dimagh lagana padhta hai Comment from : CreativeGiant |
 |
Very nicely explained Comment from : jatin kumar |
 |
Sir yaha hmne 2-D array kyu nahi banai Comment from : Parth Saraswat |
 |
I was able to do this question without even watching the video!! thankyou so much sir <3!! Comment from : Ananya Arya |
 |
Sir, I have a doubt my code is running fine, but in the case of 0 rupee coin it's giving wrong answer What to do?? Comment from : Universe Boss |
|
|
Sir, dp array 1D bnau ya 2D bnau ye clear nhi ho rha Sir, plz aap mera ye doubt clear kr dijiye Comment from : Universe Boss |
 |
Really great explanation I am just at 8min and have got it Comment from : Cosmic Whispers |
 |
thanks for your effort for making these videos with detailed explanation Comment from : Jamey Siddiqui |
 |
WTF what language does he speak? Comment from : Alexander Gonchar |
 |
whats the time complexity ? Comment from : Lak |
 |
absoultely amazing Comment from : FV |
 |
how can somebody dislike this video? Comment from : SACHIN DUHAN |
 |
Thank you for a very good approach for this problem sir I tried to solve this question using target subset sum approach but 2 test cases didn't pass According to me it happened because the coins array also contains zeroes Comment from : Sudhanshu Sharma |
 |
Sir kya hm isko v 2D dp array use kr k solve kr sakte hai jaise hmne target sum subset ko solve kiye tha?brWaha pe hm req - curr sum ko find krte the , pr yaha pe infinite coins hai to target sum ko current se divide kr k remainder ko Search krenge ? Comment from : Yelp |
 |
can you tell me one thing, ki hame pata kaise lgta h ki dp 2d array banaega ya 1d? Comment from : Prabhat Kashyap |
 |
Coin Changing Minimum Number of Coins Dynamic programming РѕС‚ : Tushar Roy - Coding Made Simple 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 |
 |
Knapsack Problem using Dynamic Programming Part I | Dynamic Programming | Lec 65 | DAA РѕС‚ : CSE Guru Download Full Episodes | The Most Watched videos of all time |
 |
The Change Making Problem - Fewest Coins To Make Change Dynamic Programming РѕС‚ : Back To Back SWE 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 |
 |
Coin Change Problem - Dynamic Programming | C++ Placement Course | Lecture 35.4 РѕС‚ : Apna College 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 |
 |
222 - The Coin Change Problem | Dynamic Programming | Hackerrank Solution | Python РѕС‚ : Hackers Realm Download Full Episodes | The Most Watched videos of all time |
