This approach uses a Trie to represent the list of words for efficient prefix matching. The algorithm performs depth-first search (DFS) on the board starting from each cell. Each path of exploration is checked against the Trie to determine if it forms any of the words or prefixes thereof. The benefit of using a Trie is that we can stop the search early if the current path does not match any prefix in the Trie, thereby improving the efficiency of the search process.
Time Complexity: O(M*(4*3^(L-1))), where M is the number of cells on the board, and L is the maximum length of a word.
Space Complexity: O(N*L), where N is the number of words, and L is the maximum length of a word, used by the Trie structure.
1class TrieNode:
2 def __init__(self):
3 self.children = {}
4 self.word = None
5
6class Solution:
7 def __init__(self):
8 self.result = set()
9
10 def findWords(self, board, words):
11 root = TrieNode()
12 for word in words:
13 node = root
14 for char in word:
15 if char not in node.children:
16 node.children[char] = TrieNode()
17 node = node.children[char]
18 node.word = word
19 for i in range(len(board)):
20 for j in range(len(board[0])):
21 self._dfs(board, i, j, root)
22 return list(self.result)
23
24 def _dfs(self, board, i, j, node):
25 if i < 0 or i >= len(board) or j < 0 or j >= len(board[0]):
26 return
27 char = board[i][j]
28 if char == '#' or char not in node.children:
29 return
30 node = node.children[char]
31 if node.word:
32 self.result.add(node.word)
33 board[i][j] = '#'
34 self._dfs(board, i + 1, j, node)
35 self._dfs(board, i - 1, j, node)
36 self._dfs(board, i, j + 1, node)
37 self._dfs(board, i, j - 1, node)
38 board[i][j] = charThis Python solution constructs a Trie with the input words and explores the board using DFS starting from each cell. It keeps track of words found using a result set, ensuring no duplicates in the output.
In this approach, we perform backtracking for each word individually. This avoids the overhead of constructing a Trie but involves repeated board scanning. A Recursive Depth First Search (DFS) is used to explore possibilities starting from each cell on the board. We maintain a visited matrix to ensure a letter is not reused in forming a particular word.
Time Complexity: O(N * M * 3^L), where N is the number of words, M is the number of cells in the board, and L is the length of the word being searched in the worst case.
Space Complexity: O(L), for the recursive call stack.
1#include <stdio.h>
2#include <string.h>
3#include <stdbool.h>
4
5bool dfs(char** board, int boardSize, int boardColSize, char* word, int index, int i, int j, bool** visited) {
6 if (index == strlen(word)) return true;
7 if (i < 0 || i >= boardSize || j < 0 || j >= boardColSize || visited[i][j] || board[i][j] != word[index])
8 return false;
9
10 visited[i][j] = true;
11 if (dfs(board, boardSize, boardColSize, word, index + 1, i - 1, j, visited) ||
12 dfs(board, boardSize, boardColSize, word, index + 1, i + 1, j, visited) ||
13 dfs(board, boardSize, boardColSize, word, index + 1, i, j - 1, visited) ||
14 dfs(board, boardSize, boardColSize, word, index + 1, i, j + 1, visited)) {
15 return true;
16 }
17 visited[i][j] = false;
18 return false;
19}
20
21bool exist(char** board, int boardSize, int* boardColSize, char* word) {
22 bool** visited = (bool**)malloc(boardSize * sizeof(bool*));
23 for (int i = 0; i < boardSize; i++) {
24 visited[i] = (bool*)calloc(*boardColSize, sizeof(bool));
25 }
26 for (int i = 0; i < boardSize; i++) {
27 for (int j = 0; j < *boardColSize; j++) {
28 if (dfs(board, boardSize, *boardColSize, word, 0, i, j, visited)) {
29 for (int k = 0; k < boardSize; k++){
30 free(visited[k]);
31 }
32 free(visited);
33 return true;
34 }
35 }
36 }
37 for (int i = 0; i < boardSize; i++){
38 free(visited[i]);
39 }
40 free(visited);
41 return false;
42}This C solution attempts to find each word on the board individually. We use a helper function dfs that tries to construct the word by moving to adjacent cells recursively. The solution checks for existence of a path for each word, returning as soon as one is found.