01 Matrix

Explore how to calculate the shortest distance from each cell to the nearest zero in a binary matrix using dynamic programming techniques. Understand problem constraints and implement solutions to optimize time and space complexity.