search

DSC-Banasthali-Vidyapith / Code-Crossroad

This project contains the carefully compiled Data Structures & Algorithm questions asked by the companies that visit Banasthali Vidyapith on-campus.
MIT License
55 stars 78 forks source link

Coin Change(DP) #75

Closed Anshika-Srivastava closed 3 years ago

Anshika-Srivastava commented 3 years ago

Aim Given a value N, find the number of ways to make change for N cents, if we have infinite supply of each of S = { S1, S2, .. , SM } valued coins.

Details Algorithm Paradigm - I will be using Dynamic Programming(Unbounded Knapsack) for this problem. I wish to work on this problem in C++ language. Please assign this to me.

Anshika-Srivastava commented 3 years ago

@Vanshikagarg17 @sakshigoel19 do look at this issue!

Vanshikagarg17 commented 3 years ago

You can start working on this issue. All the best!