Company: Visa_29Aug
Difficulty: medium
Maximize Minimum Hotspot Distance Problem Description In a bustling city, the city council is planning to set up free Wi-Fi hotspots along the main boulevard to ensure maximum coverage for residents. Due to building constraints and potential signal interference, each Wi-Fi hotspot must be placed within a specific interval along the street. The city has identified n potential installation zones, and the goal is to space the hotspots as far apart as possible to reduce interference and optimize coverage. You are given n intervals along the boulevard, where each interval [a_i, b_i] represents the range within which a Wi-Fi hotspot can be installed. Your task is to determine the locations of the hotspots within their respective intervals such that the minimum distance between any two hotspots is maximized. Input Format: The first line contains an integer n, the number of installation zones. The next n lines each contain two integers a_i and b_i, representing the start and end of the i-th in