#We need to traverse the string s and check if each word is able to be broken into words from the dictionary #We can build a substring for each letter in word and try matching it to a word in wordDict ...

//T: O(m*n*4^Length of the word) S: O(m+n+ L) dfs(row - 1, col, node, word); dfs(row + 1, col, node, word); dfs(row, col - 1, node, word); dfs(row, col + 1, node, word); ...