MCPcopy Index your code
hub / github.com/neetcode-gh/leetcode / bfs

Function bfs

javascript/0090-subsets-ii.js:44–61  ·  view source on GitHub ↗
(nums, subsets = [[]])

Source from the content-addressed store, hash-verified

42};
43
44const bfs = (nums, subsets = [[]]) => {
45 let levels = subsets.length - 1;
46
47 for (let i = 0; i < nums.length; i++) {
48 const isPrevDuplicate = 0 < i && nums[i - 1] === nums[i];
49 const start = isPrevDuplicate ? levels + 1 : 0;
50
51 levels = subsets.length - 1;
52
53 for (let level = start; level < levels + 1; level++) {
54 const nextLevel = [...subsets[level], nums[i]];
55
56 subsets.push(nextLevel);
57 }
58 }
59
60 return subsets;
61};

Callers 1

subsetsWithDupFunction · 0.70

Calls 1

pushMethod · 0.45

Tested by

no test coverage detected