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

Function dfs

javascript/0078-subsets.js:13–21  ·  view source on GitHub ↗
(nums, level = 0, set = [], subset = [])

Source from the content-addressed store, hash-verified

11};
12
13var dfs = (nums, level = 0, set = [], subset = []) => {
14 subset.push(set.slice());
15
16 for (let i = level; i < nums.length; i++) {
17 backTrack(nums, i, set, subset);
18 }
19
20 return subset;
21};
22
23const backTrack = (nums, i, set, subset) => {
24 set.push(nums[i]);

Callers 2

subsetsFunction · 0.70
backTrackFunction · 0.70

Calls 2

backTrackFunction · 0.70
pushMethod · 0.45

Tested by

no test coverage detected