How should I practice Reach the End in Time?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google online assessment problems in FastPrep.

Is Reach the End in Time associated with Google?

FastPrep tags this as a Google coding interview or online assessment practice problem when the problem catalog has that company context.

Problem · Matrix

Reach the End in Time

Learn this problem

● EasyGoogleOA

See Google hiring insights

Problem statement

A 2-D grid consisting of some blocked (represented as '#') and some unblocked (represented as '.') cells is given. The starting position of a pointer is in the top-left corner of the grid. It is guaranteed that the starting position is in an unblocked cell, and it is also guaranteed that the bottom-right cell is unblocked. Each cell of the grid is connected with its right, left, top, and bottom cells (if those cells exist). It takes 1 second for a pointer to move from a cell to its adjacent cell. If the pointer can reach the bottom-right corner of the grid within maxTime seconds, return the string 'Yes'. Otherwise, return the string 'No'.

Function

reachTheEnd(grid: String[], maxTime: int) → String

Complete the function reachTheEnd in the editor.

reachTheEnd has the following parameter(s):

String[] grid: an array of strings representing the rows of the grid
int maxTime: the maximum time to complete the journey

Examples

Example 1

grid = ["..##", "#.##", "#..."]maxTime = 5return = "Yes"

The shortest path has length 5, so the destination is reachable within the deadline.

Example 2

grid = ["..", ".."]maxTime = 3return = "Yes"

The shortest path has length 2, which is at most 3.

Example 3

grid = [".#", "#."]maxTime = 2return = "No"

Both possible first moves are blocked, so the destination is unreachable.

Constraints

1 ≤ grid.length, grid[i].length ≤ 500
All rows have equal length and contain only . and #.
The top-left and bottom-right cells are unblocked.
0 ≤ maxTime ≤ 10^5