Word Search

Statement

Given an $m \times n$ 2D grid of characters and word as a string, we need to determine if the word can be constructed from letters of sequentially adjacent cells. The cells are considered sequentially adjacent when they are neighbors to each other either horizontally or vertically. The function should return TRUE if the word can be constructed and FALSE otherwise.

Constraints:

• m $=$ board.length
• n $=$ board[i].length, where $0 \leq$ i $<$ m
• $1 \leq$ m, n $\leq 6$
• $1 \leq$ word.length $\leq 15$
• board and word consist of only lowercase or uppercase English letters.
• The search is not case-sensitive.

Examples