Vidyalelo
Data Structure · Q126

Dynamic Programming in Data Structures

Programming · Data Structure · question 126

Q126

You are given infinite coins of denominations 1, 3, 4. What is the total number of ways in which a sum of 7 can be achieved using these coins if the order of the coins is not important?

A.
4
B.
3
C.
5
Answer
D.
6

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board