Word Search

Given an m x n grid of characters 'board' and a string 'word', determine if 'word' exists in the grid. The word can be formed by sequentially adjacent cells, where neighbors are horizontally or vertically contiguous. Cells may not be reused in the construction of the word.

Constraints

  • m == board.length
  • n == board[i].length
  • 1 <= m, n <= 6
  • 1 <= word.length <= 15
  • board and word consists of only lowercase and uppercase English letters.
View editorial solution
Saving… · 3 lines
class Solution:
def wordSearch(self, board: List[List[str]], word: str) -> bool:

Console

Click Run to execute sample tests.