How should I practice Minimum-Step Right-Down Grid Path?

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

Is Minimum-Step Right-Down Grid Path associated with Bloomberg LP?

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

Minimum-Step Right-Down Grid Path

Bloomberg LP● EasyNEW GRADONSITE INTERVIEW

Learn

Problem statement

In a binary grid, 1 is passable and 0 is blocked. Starting at the top-left, reach the bottom-right using only one-cell Right or Down moves. Return the minimum number of moves, or -1 if unreachable.

Function

minimumRightDownSteps(grid: int[][]) → int

Examples

Example 1

grid = [[1,0,1],[1,1,1],[0,1,1]]return = 4

A path uses two down and two right moves.

Constraints

The rectangular grid has at most 10^6 cells.