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

Method dfs

javascript/0212-word-search-ii.js:50–59  ·  view source on GitHub ↗
(board, row, rows, col, cols, node, words)

Source from the content-addressed store, hash-verified

48 }
49
50 dfs(board, row, rows, col, cols, node, words) {
51 const char = board[row][col];
52 const child = node.children[char] || null;
53
54 if (this.canSkip(char, child)) return;
55
56 node = child;
57 this.checkWord(node, words);
58 this.backTrack(board, row, rows, col, cols, node, words);
59 }
60
61 canSkip(char, child) {
62 const hasSeen = char === '#';

Callers 2

searchBoardMethod · 0.95
backTrackMethod · 0.95

Calls 3

canSkipMethod · 0.95
checkWordMethod · 0.95
backTrackMethod · 0.95

Tested by

no test coverage detected