DIY: Coin Change 2
Solve the interview question "Coin Change 2" in this lesson.
We'll cover the following...
Problem statement
Given an integer total 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 total amount by using the ...