75. Word Search

MediumBacktracking

Given an m x n grid of characters board and a string word, return true if word exists in the grid. The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once.

Examples

Input: [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]] ABCCED

Output: true

Explanation: The word ABCCED can be found in the grid.

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.
Loading...

Run checks all cases above. Submit evaluates all test cases.