A medium graph traversal-based dsa question. Given a binary grid of n*m. Find the distance of the nearest 1 in the grid for each cell.The distance is calculated as |i1 - i2| + |j1 - j2|, where i1, j1 are the row number and column number of the curre...
bandeblogs.com4 min readNo responses yet.