0 votes 0 votes Q.1 In a country there are coins of denominations $2, $3, $5 and $7. How many different ways are there to pay exactly $10? approach?? BASANT KUMAR asked Jan 19, 2019 BASANT KUMAR 543 views answer comment Share Follow See 1 comment See all 1 1 comment reply raahul commented Jan 19, 2019 reply Follow Share It is actually coin change problem which is solved using dynamic programming. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Go on with highest denomination combination. 7 + 3 = 10 Break 7 int (5 + 2) 5 + 2 + 3 =10 Break 5 into (3+2) 3+2+3+2=10 No further breaking possible So total 3 combination. Edit after Subhanshu's comment 2 + 2 + 2 + 2 + 2 = 10 and 5 + 5 = 10 So 5 combinations. Rishabh Agrawal answered Jan 19, 2019 • edited Jan 19, 2019 by Rishabh Agrawal Rishabh Agrawal comment Share Follow See 1 comment See all 1 1 comment reply Shubhanshu commented Jan 19, 2019 reply Follow Share 2,2,2,2,2 AND 5,5 is missing. 1 votes 1 votes Please log in or register to add a comment.