Word Search in 2D Grid with Diagonal Moves

You are handed a two-dimensional grid of characters board and a string word. Write a function that decides whether you can spell word by starting at any cell and repeatedly moving one step—up, down, left, right, or any of the four diagonal directions—to an adjacent cell. A cell may only contribute its character once per attempt; you cannot step onto a cell you already used while building the current sequence. Return true if word can be formed in this way, and false…