1391. Check if There is a Valid Path in a Grid

You are given 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 me