Given an $m imes n$ grid grid of characters, each cell is defined as follows:

• 'W' represents a wall.

• 'E' represents an enemy.

• '0' represents an empty cell.

Return the maximum number of enemies you can destroy by placing one bomb in an empty cell.

When a bomb is placed in an empty cell, it destroys all enemies in the same row and column extending in all four directions up to the edge of the grid or until blocked by a wall, because walls cannot be destroyed.

Constraints:

• m $==$ grid.length

• n $==$ grid[i].length

• $1 \leq m, n \leq 500$

• grid[i][j] is either 'W', 'E', or '0'.

Now, 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.

Implement your solution in the following coding playground.