Find minimum number of coins (using Dynamic Programming) | GeeksforGeeks

This video is contributed by Ishmeet Kaur

Please Like, Comment and Share the Video among your friends.

Also, Subscribe if you haven't already! :)

[bekhzodabduraufov]

You are like my professor at university, all she does is just reading the slides. LOL.

[pratikgupta]

what is the meaning of audio in this..if you are just reading the slides...this was not expected from GeeksforGeeks

[AH-jpqj]

Geeks for Geeks should maintain their high standards.
This video is pathetic.
Dissapointed

[anandkulkarni]

You need to derive that formula coding is the dumb part how that formula was found or derived is the essence

[astral_addendum]

i don't understand all that negative comments guys! this one is the best intuitive explanations with common concepts .i cleared a lot from half of the video. the summary is,
iterate from 0 to lenght of given array:
if current value of the coin is less than the required value, it means we have to include it right? so, we include the current value, i.e. subtract the current values from required value and pass it recursively until it reaches up to 0. i.e.

recursive forwarding( until we get a 0)
lvl 1) outer-iteration: || func(arr, len, (11-9)->func(arr, len, 2)->iterate while it gets the value
less than 2 do we have it? (after inner recursion ) yes we have 1, so the next call would be
||. func(arr, len, (2-1))->func(arr, len, 1)->iterate while it gets the value// returns 1
less than 1 do we have it? (after inner recursion ) yes we have 1, so the next call would be,
||. func(arr, len, (1-1))->func(arr, len, 0)->now returns 0
let's backtrack:
if the result is max yet? (we returned 0 so, no) no so, sub_result =0 no, its not equal to max, so res = sub_result+1 = 1 get upto func(arr, len, 1) to add extra 1 which shall set first outer-iteration to ((0+1)+1)=2


//don't confuse it with coin change problem, rather it suggests to calculate minimum length among those subsets, i.e. the number of coins not the no. of ways

[vishalmahavratayajula]

Best out of waste. The best I can get from your playlists is the different types of question models. Thanks for that.
And regarding your explanation, you are degrading yourselves guys. Can do much better if you understand the problem, do research and then explain.

[sukanyaagarwal]

No point of this video. Got more confused than I was. We can read the code as well. Whats expected is the explanation of how the formula was deducted. Disappointing!

[BobbyBattista]

This video lacks explanation in general. Recursive Solution slide in particular, Implementation slide at 2:00 also, for example what is int m? Illustration slide at 2:50 it would be nice to see what code we're running and maybe what the variables hold, what the stack looks like, something that illustrates what's going on better. I keep hearing things like "We set table[i] = INT_MAX" without explaining what table[i] is, or why we're setting it to INT_MAX. It was frustrating watching this, I don't think I've ever given a thumbs down to an educational video, but it's really quite disappointing.

[deepakatariya]

I am in love with dynamic programming! thank you so much

[shwetapawar]

why u just reading ? we can read that tho!

[sharathgowda]

Disappointed very bad gfg dint expect this... U are our first source for any doubts and this is how u clarify it??

[navaneethmkrishnan]

Where is the part where we return -1 for impossible cases. For example coins = {3, 5} and sum = 4. This case is impossible, and hence, we need to return -1. No part of this code actually does that. Or is there something that I am missing?

[priyankamanna]

Concept is not been explained properly .... Disappointed 🙄😣

[AbhishekKumar-kkqs]

Almost video of GFG editorial just read the code, like we don't know how to read code we need some sort of deep explanation why this formula is used .
I think if there is more to dislike the video I should do that.
Sorry to say this is the reality.

[manikantareddy]

very poor explanation, I request geeks for geeks to remake it again with clear explanation, and how the table is filled in the end is not clear, once look at it...

[vishalpatil]

High level Site but Explaination is so much poor. Your the guys are good for showing the results only. Dispointed from GEEKSFORGEEKS not expected

[AkashVerma-mgys]

The video implementation of geeksforgeeks tutorial is not satisfactory. Please give attention to this part. Thank you.

[himanshumittal]

Everyone can read the slides, you are supposed to explain the logic.
Got Frustrated after watching this.

[sangitahira]

can anyone explain this dynamic method more clearly..i cant understand properly...

[allanmagalhaes]

There's no explanation at all. Why is the result intialized as int_max? Everybody here already looked at the code before and didn't get it, then we come here and all we get is somebody reading the slides lol.