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 formed by connecting letters of sequentially adjacent cells. The cells are considered sequentially adjacent when neighbors are either horizontally or vertically neighbors. Each cell can be used only once while forming the word.

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 and uppercase English letters.

Let’s take a moment to make sure you've correctly understood the problem. The quiz below helps you check if you're solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.