How should I practice Bomb Enemy Best Coordinates?

Start by reading the full statement, solve the visible examples, then compare the pattern against related SambaNova Systems onsite interview problems in FastPrep.

Is Bomb Enemy Best Coordinates associated with SambaNova Systems?

FastPrep tags this as a SambaNova Systems onsite interview coding practice problem when the problem catalog has that company and stage context.

Bomb Enemy Best Coordinates

SambaNova Systems● MediumNEW GRADONSITE INTERVIEW

Learn

Problem statement

A grid contains enemies E, walls W, and empty cells 0. A bomb may be placed in one empty cell and kills every enemy in the same row and column until a wall blocks the direction.

Return every zero-based coordinate [row, column] that achieves the maximum kill count, ordered by row and then column. If there is no empty cell, return an empty array. Cells with a maximum of zero are still returned.

Function

bestBombCells(grid: String[]) → int[][]

Examples

Example 1

grid = ["0E00","E0WE","0E00"]return = [[1,1]]

The center-left empty cell reaches three enemies.

Example 2

grid = ["0"]return = [[0,0]]

The only empty cell is the maximum even though it kills zero.

Example 3

grid = ["EEE"]return = []

There is no legal bomb cell.

Constraints

1 <= rows, columns <= 500.
The grid is rectangular and contains only E, W, and 0.