Lecture 104: Minimum Number of Coins || DP Series

[@CodeHelp]

Correction: In the Recursion + Memoisation approach, we are TLE due to not changing the function call os solveRec to solveMem in "solveMem" function, change that to get rid of TLE.

[@vedprakash3621]

Atleast someone is here to help and correct us. Thank you bhaiya

[@pranavdamedhar5375]

yes bhaiiya ..ek request this bas dp ke liye aap thoda jyada page pe samjhane ka try kro n...drct code krne se samjh nhi ata easily

[@iamsuryakant]

In solveMem function.. you return mini. it should be return dp[x].

[@ayushraj6525]

@@iamsuryakant Exactly!

[@TechCluesByAbsek]

Dear bhaiya, your all videos are awesome, **** humble feedback what I felt**** >> feel nhii aaya to convert recursive to bottom-up, it needs more explanation.(what I feel). everything else is top class.

[@akshayiyer2014]

This series is very helpful in understanding dynamic programming. Last month i gave close to 40+ interviews and saw product based companies like Walmart, DP World, Zoomcar, Swiggy, MMT and some startups asking DP or heap related questions. LeetCode and your channel has helped a lot in brushing my dsa skills.

[@keshavgupta383]

last 2 dp series lecture was amazing but this lecture had some problem in understanding if you could dry run that part would be grateful

[@TechCluesByAbsek]

Dear bhaiya, your all videos are awesome, ** humble feedback what I felt** >> feel nhii aaya to convert recursive to bottom-up, it needs more explanation.(what I feel). everything else is top class.

[@laxmankumawat6728]

Dry run karke pura bta dete hai tab maaza aata hai Base case jab rich ho jata hai toh badh me call kaise uper aati hai include all questions this make this series more best

[@sourabhshubham2910]

Aap jis tareeke se padha rhe ho na utna hi kaafi hai, multiple approach , aur padhaane ka tareeka , brilliant hai, Thanks a lot for this series :)

[@kungagyaltsenlachungpa8915]

last 2 dp series lecture was amazing but this lectur had some problem in understanding the mimimum coin flow if you could dry run that part would be grateful.Apart from that dp series blockbuster ha.

[@codexamofficial]

Memorization solves - 14:42 Mistake one - call solveMem function line 32 2nd Mistake pass dp line 32 .... thanks for making this great playlist int solveMem(vector &num , int x , vector&dp) { // Base Case if(x == 0) return 0; if(x < 0) return INT_MAX; // dp case if(dp[x] != -1) return dp[x]; // Recursive case int mini = INT_MAX; for(int i = 0; i < num.size(); ++i) { int ans = solveMem(num , x-num[i] , dp); if(ans != INT_MAX) mini = min(mini , ans+1); } // Recrence Reletion dp[x] = mini; return mini; } int minimumElements(vector &num, int x) { vectordp(x+1 , -1); int ans = solveMem(num , x , dp); if(ans == INT_MAX) return -1; else return ans; }

[@naveenshukla3517]

bhaiya out of above 104 lectures, this was the first lecture, jisme acche se smjh ni aya

[@Kinggaming-hp3qp]

guruji ko bhut bhut pyar and dil se aabhar.

[@itspurelypassionate]

for people who didn't understand tabulation method: i = coin number increasing form 1 to x. X is a target sum. num[j] gives coin value. Suppose that i = 2 and num[j] is also 2 then i - num[j] is zero. that means that we should add 1 to the amount of coins needed to get sum 0. We know that 0 coins are needed so (1 + 0) is 1 and minimum of dp[i] = min(dp[i], 1). if previously dp[i] value was MAX_VALUE than dp[2] will become 1. That means to get sum of 2 we need only 1 coin. Now iterate this through all the coins. U will get to know that 1 is the only correct answer (given 2 is present in "num" array. This is just an example. Feel free to ask any doubts)

[@Nitian_Trader07]

Bhaiya top down approach mai -> [14:47] yahan line no. 33 mai agar ans = INT_MAX aaya to wo if mai nahi jayega or direct mini jo ki INT_MAX hai wo return karega previous called function ko . To pichle function ko int_max hi milte rahega har baar kyuki minimum nikal hi nahi payega kyuki wo line no. 33 ke if condition ke karan . Koi to ho jo ise aache se samjhe pls bhaiyaa make correct that question for upcoming students.

[@vishwamshourya3354]

sir if u will dry and run the code from the following problems, then it will be more helpful, facing a few problems in understanding the memoization approach of this problem..otherwise everything is perfect.

[@luckydewangan5985]

Recursion+memoization vala approach is giving TLE because in solveMem fxn, the recursive relation is calling solveRec instead of solveMem. So effectively recursion+memoization+recursion ki khichdi ban ja rahi hai.😁😁

[@tanayabiswas2417]

exactly, i saw that as well

[@therealartist9]

bhai gend fatke char ho gyi lekin samajh ni aya

[@inter3988]

@@therealartist9 kya nahi aya?

[@keshavarya5999]

Best content on YT......Desi style

[@NxNinjae]

In your solveMemo function by mistake you used solveRec function that's why it is given TLE

[@chandrabhanbahetwar9638]

This is one of the best dsa series in the you tube

[@shreyashdubey5989]

Bhaiya Mauj Krdia, Lecture Completed !!! Great Explanation❤❤

[@B-NikhilRichhariya]

bohot achha lect tha bhaiya , is baar bhi poore code khud se ban gaye

[@rohitrohra7553]

aapse seekh ke aza aata hai . Ekdum ghar jaisa

[@RahulKumar-wt9qc]

Jabardast explanation tha video me bhaiya

[@rachit_joshi]

Thank You So Much BHRATA SHREE !!!!!!!

[@yashzawar7938]

took time to understood the solution but got it at the end as i tried to solve on my own with this logic

[@tejalgarud7795]

One of the best learning platform, Thank You Bhaiyya!!

[@abhasatin7300]

thanks bhaiya..after doing a dry run i was able to understand better. i wish the code explanation part came before running the code or while writing the code, easier to understand

[@aaravkumar1308]

bhaiya sab badiya chal rha hai .. U are making the best series .. Keep it up >>

[@harishkumar2107]

What a consistent bhaiya you are best when it comes to coding 🔥🔥❣️❣️🤩

[@yashh7449]

Samajh aagya, aur maza bhi aagya ❤

[@devangmishra4506]

gazzab ka lecture ...bhaiya opp

[@haiderali0801]

concept++ , bhaiya.

[@anujonthemove]

Explanation for recursive solution: Out of all possible combinations of the coins(which is what can be seen by the recursion tree), we have to find that 1 combination that makes up to the given amount using minimum number of coins. We are creating the variable `mini` which is initialized with max value, now it is getting updated every time during the recursion when it's previous value is more than the current value. Great explanation except for the glitch in the memoization part. Ek hi baat bolna hai: bhai samajh to acche se hindi me hi aata hai 😝

[@ellis-pr7hh]

Last line is TRUE

[@awesomepatt620]

Amazing concept bhaiya 🤩🤩

[@anupamyadavnit7512]

Thanks for this wonder full lectures 👍

[@namyajain5927]

Can someone please explain why are we taking vectordp(x+1,INT_MAX ) in tabulation solution?

[@Singh_Sahdev]

Bro let you took -1 in dp array, then -1 would be itself a small value, We cannot find minimum no. Of coins hence we took INTMAX to minimize that value

[@khushdevyogi6511]

Bro you are most helpful at this time for me😍

[@DeepakSingh-fd2ix]

sir uda diya yeh video toh 😶😶😶😶😶😶

[@iteself_me]

186 ✅completed 👍Liked 09:29

[@nishankdeep3084]

thank you bhaiya bhaya poora ache se clear hua

[@gopal_cse]

correction : include int solveRec(vector &num,vector &dp, int x){ if(x==0) return 0; if(x

[@dewanshyadav6033]

❤️❤️❤️❤️❤️Bhaiyya this problem is solved using (Recursion+Memoization) method also ...you have not passed the dp array in recursive call => int ans = solveMem(num,x-num[i],dp); the why it was giving TLE error.... and Thank you bhaiya for this amazing lecture... ❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️

[@shoumickbardhan1460]

Well, I don't know about other platforms, but this by far the best DSA series ever made available on KZbin. That too even Free. Lots of Love Bhaiya😊😊

[@sukhjitsingh959]

Yes here is problem to understand this code ..you are explain very fast about this code if you do little slow explain with dry run will be more cool thanks

[@unknownuser6143]

Awesome... very nice bhaiya...sab kuchh achchhe se samajh me aaya.

[@aryankhatana7202]

Namaste Bhaiya App ne jo solveMem function me for loop ke andar solveRec ko kol kiya hai isliye TLE aya hai agar app solveMem karogye to correct answer ayega Thankyou Bhaiya for this Amazing C++ With DSA Course

[@jaisriRam4]

Great work bhaiya ji ❤️❤️❤️

[@RaviRavi-kt9gt]

Starting my dp series from today 😀

[@kumarpawansahh]

Dhanya ho gye bhaiya ji

[@amishapandey6875]

Thank you bhaiya!

[@PRIYANSHUKUMAR-un9zu]

Present bhaiya ❤✌🔥

[@ramankr0022]

Very helpful. Thanks for uploading.

[@AJEETSINGHYADAV-g1n]

@CodeHelp Bhaiya we need to update the dp[x] in for loop itself for Memoisation Method for(int i=0;i

[@yashraghuwanshi7710]

sir please dry run each code it make it more easy to understand concept and it work as memorization for us

[@antimr2808]

thank you so much for creating this video

[@Dhairyagaurr]

Babber bhaiya, Add these videos in DSA Series

[@jaydwarkadhish959]

Sir amazing video super

[@codewith_ayushluthra5248]

thank you bhaiya

[@kalpi5023]

thank you bhaiyaa

[@abhishekverma1528]

consistency++

[@pramantomar822]

Loving the series ❤️❤️❤️❤️❤️❤️❤️❤️

[@ayushgupta1881]

Thank you soo much bhaiya

[@nikhilchopra8919]

Bhaiya maza aa gaya +++++++++++++++++++++++++++++

[@sarthaknikhal5540]

Acha padha rahe ho

[@itspurelypassionate]

These series is so fuckn helpful. Thanks!!

[@rahul191jain]

I think memorization method is throwing tle because inside that method, recursive function of method 1 is being called rather than memorized one.

[@gauravkumar3036]

Nope

[@vortexdeo4545]

5:58 A lot going on in mind, Microsoft Resignation wale time ke aas paas ki video hai

[@nayanjaiswal]

Consistency op 😁

[@vortexdeo4545]

29:25 Burnout. Tough times.

[@Aryan-se7zh]

WHY CAN'T WE DO THIS BY THIS APPROACH? #include #include int minimumElements(vector &num, int x) { int n = num.size(); if(x == 0) return 0; int ans=0; sort(num.begin(), num.end()); for(int i=n-1;i>=0;i--){ ans += x/num[i]; x = x%num[i]; } if(x == 0) return ans; else return -1; }

[@manikantadevadiga7146]

sort.

[@johnangelo2000]

@7:22 "Kaise niklega answer !! Arey Bhaiya bahut simple lag raha hai thoda sa !! Theek hai !!!" ..

[@Abc-lr4bf]

understood very well

[@nayanjaiswal]

Present sir 🙏

[@mohitdeo780]

if (target

[@yashwantmishra9109]

Watching you design course 🙂

[@energy4562]

love you bro 😍

[@sukhjitsingh959]

Sukhjit present here nice 👍

[@amaljogy4319]

Incase anyone wants the right Memotizatoin code by recursion -> int solveMem(vector& coins, int n, vector& dp){ // base case if(n==0) return 0; if(n

[@VikramSingh-cc6np]

mja aa gya bhaiya best quality content free of cost dekh ke

[@jyotiradityayadav6247]

Bhaiya memoization TLE nhi dega Aapne Memoization me recurssion wale function ko call kr diya hai isliye woh TLE dera uski jagah memoization wale function ko call kroge toh shi ans dega solveMem(num, x-num[i],dp);

[@sounaksaha1455]

+1

[@priyankajhamb7061]

Thankyou Sir

[@JohnSmith-uu5gp]

Awesome 🥰

[@SajanKumar-ec2us]

Include why memoisation and dry run of tabulation

[@saqibmasood501]

sort krke aur optimize krskte the kya

[@shubhamistic]

on 11:19 you are not returning ans from main function i.e "minimumElements" so how you are able to get your all test cases passed ??

[@paarthpatel861]

Keep doing it

[@m.afnan2018]

LoveForBhaiya++;

[@shubham57641]

Memoization code was absolutly fine there was only one mistake making recursive calls int Helpher_minimumElents(vector &num, int x,vector &DP) { //bse case if(x==0)return(0); if(x

[@sakilahmed2911]

I noticed that

[@sagnikmodak4178]

thanks sir

[@rishitshah2602]

8:20 WhatsApp notification came

[@sahilanand30]

🔥

[@AshutoshEE-]

Swad++ bhaiya🙏🙏

[@randomguy7246]

bhaiya DRY RUN isme aapne nai kraya jaise pehle me krwaya tha wo x-num[i] relation etc usse smjhne me assani hoti

[@BereniceVirginis]

what about using greedy algorithm, I think it will improve our solution

[@kanhaiyalalkumawat7055]

superb

[@AbhishekGupta-cg2vj]

not understood bhiayaa

[@silverlining7778]

helpful video

[@Its_._aayush]

maja aagya

[@vishalgarna4580]

Samajh+++

[@vishalgarna4580]

Achi hai

[@insaafarmy786]

sab dimak k upper sey

[@eprithvikushwah4754]

Maza aaya

[@DurgaShiva7574]

out of ALL the videos which you have made til date....this is the first , and the only video.. jaha pe mereko samajh nahi aaya :(

[@chainsawman-hell666]

bilkul