Untitled

/*
---
317. Shortest Distance from All Buildings

// Brute force - go from each empty land, and bfs to all of the buildings and calcluate distance between each. check for minimum
- space inefficeint, need to track visits
// better solution - bfs from buildings

1 by 1 each gate
memoization - check distance from each point

decremtn value vs visited set
---
*/