DP coin change problem in C++

[find3rskeeper]

Title:

Coin change Problem
https://www.interviewbit.com/problems/coin-sum-infinite/

Body:

You are given a set of coins S. In how many ways can you make sum N assuming you have infinite amount of each coin in the set.

Note : Coins in set S will be unique. Expected space complexity of this problem is O(N).

Example :

Input :
S = [1, 2, 3]
N = 4

Return : 4

Explanation : The 4 possible ways are
{1, 1, 1, 1}
{1, 1, 2}
{2, 2}
{1, 3}

I am working on this problem

[gktejus]

I would like to work on this issue!

[find3rskeeper]

Hey I created an issue for myself. I wanted to contribute in this. :)

[ayerhs7]

I have solved this issue. Please let me contribute :)