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

Function transform

javascript/0127-word-ladder.js:39–51  ·  view source on GitHub ↗
(queue, wordSet, seen, word, depth)

Source from the content-addressed store, hash-verified

37};
38
39const transform = (queue, wordSet, seen, word, depth) => {
40 for (const index in word) {
41 for (const char of 'abcdefghijklmnopqrstuvwxyz') {
42 const neighbor = getNeighbor(word, index, char);
43
44 const hasSeen = !wordSet.has(neighbor) || seen.has(neighbor);
45 if (hasSeen) continue;
46
47 queue.enqueue([neighbor, depth + 1]);
48 seen.add(neighbor);
49 }
50 }
51};
52
53const getNeighbor = (word, index, char) => {
54 const neighbor = word.split('');

Callers 1

bfsFunction · 0.85

Calls 2

getNeighborFunction · 0.85
addMethod · 0.45

Tested by

no test coverage detected