There are N stations for relaying messages. One station sends a message to all other stations within a certain distance and each station relays the message again. Given the distance beetween all stations and distance K, tell if it\'s possible that all stations receive a message from a specific station. \n***Suggested Solution***\nMethod:  boolean canReceiveMessage(int[][] distances, int originStation, int k)\nStarting from the originStation, do a BFS and only put the stations within distance k to the queue. If all stations are visited return true.\n\n**Follow up**: Given the distance beetween all stations, find the minimum K to ensure all stations can receive a message from a certain station.\n***Suggested Solution***\nFind the closest station (with minDist) and farthest station (with maxDist) to the originStation.  minDist <= K <=maxDist\nDo a binary search between minDist and maxDist by calling canReceiveMessage.\n\nPlease let me know what you think.\nYOE: 10\nLOC: US\nPOS: L5

There are N stations for relaying messages. One station sends a message to all other stations within a certain distance and each station relays the message agai