LeetCode 518: Coin Change II
Problem Restatement We are given an integer amount and an array coins . Each value in coins is a coin denomination. We have an infinite number of each coin type. We need to return the number of different combinations that can make up exactly amount . If the amount cannot be formed, return 0 . The order of coins does not matter. For example, [1, 2, 2] and [2, 1,...