MCPcopy Create free account
hub / github.com/neetcode-gh/leetcode / dfs

Function dfs

javascript/0518-coin-change-ii.js:18–31  ·  view source on GitHub ↗
(amount, coins, n)

Source from the content-addressed store, hash-verified

16};
17
18var dfs = (amount, coins, n) => {
19 const isLess = amount < coins[n - 1];
20 if (isLess)
21 return change(amount, coins, n - 1); /* Time O(2^N) | Space O(N) */
22
23 const left = change(
24 amount - coins[n - 1],
25 coins,
26 n,
27 ); /* Time O(2^N) | Space O(N) */
28 const right = change(amount, coins, n - 1); /* Time O(2^N) | Space O(N) */
29
30 return left + right;
31};
32
33/**
34 * DP - Top Down

Callers 1

changeFunction · 0.70

Calls 1

changeFunction · 0.70

Tested by

no test coverage detected