Bomb Enemy
Problem Description
Given a 2D grid, each cell is `'W'` (wall), `'E'` (enemy), or `'0'` (empty), return the maximum number of enemies you can eliminate by placing a bomb in an empty cell. The bomb kills all enemies in the same row and column until a wall blocks it.
**Example:**
```
Grid:
[['0','E','0','0'],
['E','0','W','E'],
['0','E','0','0']]
```
Output: `3` (placing bomb at (1,1) kills 3 enemies)
Example Test Cases
Example 1
Input: [[["0","E","0","0"],["E","0","W","E"],["0","E","0","0"]]]
Expected: 3
Example 2
Input: [[["0"]]]
Expected: 0
Run your code to see the results