DIY: Coin Change 2

Problem statement

Given an integer amount representing the total amount of money and a list of integers called coins where each coin[i] contains a unique coin with a different denomination.

You have to find the total number of ways that can make up the amount by using the ...