Coin Change Problem in C++

[Faraaz22]

I wish to solve this problem: Given an integer array of coins[ ] of size N representing different types of denominations and an integer sum, the task is to find the number of ways to make sum by using different denominations.
Kindly assign this task under for hacktober.