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

Function dfs

javascript/0416-partition-equal-subset-sum.js:26–39  ·  view source on GitHub ↗
(nums, index, subSetSum)

Source from the content-addressed store, hash-verified

24};
25
26var dfs = (nums, index, subSetSum) => {
27 const isBaseCase1 = subSetSum === 0;
28 if (isBaseCase1) return true;
29
30 const isBaseCase2 = index === 0 || subSetSum < 0;
31 if (isBaseCase2) return false;
32
33 const difference = subSetSum - nums[index - 1];
34
35 const left = dfs(nums, index - 1, difference);
36 const right = dfs(nums, index - 1, subSetSum);
37
38 return left || right;
39};
40
41/**
42 * DP - Top Down

Callers 1

canPartitionFunction · 0.70

Calls

no outgoing calls

Tested by

no test coverage detected