change = (amount, coins, n = (coins.length)) => {
    const isBaseCase1 = (amount === 0);
    if (isBaseCase1) return 1;

    const isBaseCase2 = (n === 0);
    if (isBaseCase2) return 0;

    return dfs(amount, coins, n);/* Time O(2^N) | Space O(N) */
}
Brute Force - DFS
Time O(2^N) | Space O(N)
@param {number} amount
@param {number[]} coins
@return {number}