Word Search ## The Challenge You are provided with a 2-D grid of characters called board and a specific string called word. Your task is to determine if the word exists inside the grid. If it

Word Search ## The Challenge You are provided with a 2-D grid of characters called board and a specific string called word. Your task is to determine if the word exists inside the grid. If it does,

return true. If not,

return false. To find the word, follow these rules: 1. You can form the word by connecting letters that are next to each other (horizontally or vertically). 2. You cannot use the exact same cell position more than once for the same word.

Sample Cases

Case 1:

Input: board = [["A","B","C","D"], ["S","A","A","T"], ["A","C","A","E"]], word = "CAT"

Output: true

Case 2:

Input: board = [["A","B","C","D"], ["S","A","A","T"], ["A","C","A","E"]], word = "BAT"

Output: false ## Technical Limitations * The size of the board (rows and columns) is small: between 1 and 5. * The length of the word is between 1 and 10 characters. * Both the board and the word contain only standard English letters (lowercase and uppercase).