Google

Radio Tower Communication Network BASE PROBLEM You are given 'n' radio towers, each with (x, y) coordinates. You are also given a maximum transmission range 'd', a 'start' tower index, and an 'end' tower index. Two towers can communicate directly if their Euclidean distance is less than or equal to 'd'. Formula: $sqrt((x1 - x2)^2 + (y1 - y2)^2) \le d$ Messages can be relayed through other connected towers. Task: Return True if a message can reach from the 'start' tower to the 'end' tower, otherwise return False. FOLLOW-UP 1 Instead of a fixed range 'd', you can adjust the power of all towers. Task: Find the minimum required range 'd' that allows the 'start' tower to successfully route a message to the 'end' tower. FOLLOW-UP 2 Revert to a fixed range 'd'. A new rule is introduced: a tower will now ONLY relay messages to its absolutely nearest neighbor(s) within range 'd'. Example: If d=5, and a tower has neighbors at distances 2 and 3, it will only transmit to the neighbor at distance 2. Task: Under this nearest-neighbor rule, determine if the 'start' tower can still reach the 'end' tower.