Shortest Distance from All Buildings, is a LeetCode problem from graphs subdomain. In this post we will see how we can solve this challenge in Swift

Problem Description

You can find the full details of the problem Shortest Distance from All Buildings at LeetCode

Solution

then figuare out the smallest one of all candidates

Time Complexity: O((mn)^2), Space Complexity: O(mn)

Please check the main.swift snippet for the solution.

This solution originally posted at: Github by @soapyigu