Check if There is a Valid Path in a Grid

Medium

You receive an m x n grid. Each cell of grid represents a street. The street of grid[i][j] can be:

1 which means a street connecting the left cell and the right cell.
2 which means a street connecting the upper cell and the lower cell.
3 which means a street connecting the left cell and the lower cell.
4 which means a street connecting the right cell and the lower cell.
5 which means a street connecting the left cell and the upper cell.
6 which means a street connecting the right cell and the upper cell.

You will initially start at the street of the upper-left cell (0, 0). A valid path in the grid is a path that starts from the upper left cell (0, 0) and ends at the bottom-right cell (m - 1, n - 1). The path should only follow the streets.

Notice that you are not allowed to change any street.

Produce true if there is a valid path in the grid or false otherwise.

Original illustrative diagram 1 for Check if There is a Valid Path in a Grid

Example 1

Original illustrative diagram 2 for Check if There is a Valid Path in a Grid

Input: grid = [[2,4,3],[6,5,2]]

Output: true

Explanation: As shown you can start at cell (0, 0) and visit all the cells of the grid to reach (m - 1, n - 1).

Example 2

Original illustrative diagram 3 for Check if There is a Valid Path in a Grid

Input: grid = [[1,2,1],[1,2,1]]

Output: false

Explanation: As shown you the street at cell (0, 0) is not connected with any street of any other cell and you will get stuck at cell (0, 0)

Example 3

Input: grid = [[1,1,2]]

Output: false

Explanation: You will get stuck at cell (0, 1) and you cannot reach cell (0, 2).

Check if There is a Valid Path in a Grid

Constraints

Did this problem appear in one of your interviews?

Acceptance rate: 0%