Word Search
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.

30:00

Word Search
medium
Topics
Companies

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.

Example 1:
Input: {"board":[["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]],"word":"ABCCED"}
Output: true
Constraints:

  • m==board.lengthm == \text{board.length}

  • n==board[i].lengthn == \text{board}[i].\text{length}

  • 1≤m,n≤61 \leq m, n \leq 6

  • 1≤word.length≤151 \leq \text{word.length} \leq 15

  • board and word consist of only lowercase and uppercase English letters.

Input
arr ={"board":[["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]],"word":"ABCCED"}

Start search at (0,0)

A

B

C

E

S

F

C

S

A

D

E

E

Variables
VariableValue
r0
c0
DepthFunction Call
Stack empty
0/21