Solution: 01 Matrix

Explore how to calculate the distance from each cell to the nearest zero in a binary matrix by applying dynamic programming. Understand optimal substructure and overlapping subproblems, and implement a two-pass algorithm that ensures efficient computation with O(m×n) time and constant space complexity.