Link:https://www.codechef.com/NOON2018/problems/NN005
Can anyone explain the base case used in dynamic programming approach clearly.
Bro It’s a classic coin change problem .
Here is my submission(Bottom Up approach) for this 
Also take a look at this, it might help 
