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

Function bfs

javascript/0139-word-break.js:164–174  ·  view source on GitHub ↗
(queue, s, wordSet, seen)

Source from the content-addressed store, hash-verified

162};
163
164const bfs = (queue, s, wordSet, seen) => {
165 while (!queue.isEmpty()) {
166 for (let level = queue.size() - 1; 0 <= level; level--) {
167 /* Time O(N) */
168 if (canWordBreak(queue, s, wordSet, seen))
169 return true; /* Time O(N * N) | Space O(N + WIDTH) */
170 }
171 }
172
173 return false;
174};
175
176var canWordBreak = (queue, s, wordSet, seen) => {
177 const start = queue.dequeue();

Callers 1

wordBreakFunction · 0.70

Calls 3

canWordBreakFunction · 0.85
isEmptyMethod · 0.45
sizeMethod · 0.45

Tested by

no test coverage detected