Word Search Problem Statement

Given a two-dimensional grid with 'N' rows and 'M' columns consisting of uppercase characters, and a string 'WORD', your task is to determine the number of times the word appears in the grid.

You can move from a given cell in eight possible directions: horizontally left, horizontally right, vertically up, vertically down, and the four diagonal directions.

Example:

Input:

N = 4
M = 5
Grid =
"ANAAN"
"NINJA"
"NINAN"
"ANANA"
WORD = "NINJA"

Output:

3

Explanation:

The word "NINJA" can be found three times in the given grid.

Constraints:

1

Question

Word Search Problem Statement

Given a two-dimensional grid with 'N' rows and 'M' columns consisting of uppercase characters, and a string 'WORD', your task is to determine the number of times the word appears in the grid.

You can move from a given cell in eight possible directions: horizontally left, horizontally right, vertically up, vertically down, and the four diagonal directions.

Example:

Input:

N = 4
M = 5
Grid =
"ANAAN"
"NINJA"
"NINAN"
"ANANA"
WORD = "NINJA"

Output:

Explanation:

The word "NINJA" can be found three times in the given grid.

Constraints:

1 <= N <= 10^3
1 <= M <= 10^3
1 <= N * M <= 10^6
2 <= WORD.size <= 10^3
Time Limit: 1 sec

Note:

You do not need to print anything; implement the given function to return the correct output.

Accepted Answer

Count the number of occurrences of a given word in a two-dimensional grid of characters.

Iterate through each cell in the grid and check if the word can be formed starting from that cell in any of the eight directions.
Use backtracking to explore all possible paths while matching the characters of the word.
Keep track of visited cells to avoid revisiting the same cell in the same path.
Return the count of occurrences of the word in the grid.