Furthest Empty Plot From Buildings

Graphs Contest Easy

You are given a map of a city represented as a square n×n grid. Each cell in the grid is either:

0 representing an empty plot of land, or 1 representing a building.

Your task is to find an empty plot of land such that the distance to the nearest building is maximized, and return this distance. If there are no buildings or no empty plots, return −1.

The distance between two locations (x1,y1) and (x2,y2) is calculated using the Manhattan distance formula: |x1-x2|+|y1-y2|

Constraints

  • n == grid.length
  • n == grid[i].length
  • 1 <= n <= 100
  • grid[i][j] is 0 or 1

Company Tags

[ ]