Solution: 01 Matrix
Let's solve the 01 Matrix problem using the Dynamic Programming pattern.
We'll cover the following...
Statement
Given an mat
, find the distance from each cell to the nearest
Constraints:
mat.row
,mat.col
mat.row * mat.col
mat[i][j]
...