Word Search
Intermediate
board is a grid of letters given as a list of equal-length strings. Return True if word can be spelled by walking from cell to neighbouring cell (up, down, left or right), where each cell is used at most once in the path.
Examples
Example 1
Input:
word_search(['abce', 'sfcs', 'adee'], 'abcced')
Output:
True
Example 2
Input:
word_search(['abce', 'sfcs', 'adee'], 'abcb')
Output:
False
Constraints
0 <= rows, cols <= 60 <= len(word) <= 12- Lower-case letters. The empty word is always found.
Theory
Go to TheoryKeywords
dsa-sheetrecursionbacktracking-puzzles
Run your code to see results
No results yet
Run your code to check it against the examples, or submit to run every test.