Problem Statement

WI-FI Router Installation Problem Description A new smart-city development needs Wi-Fi routers installed so that every residential building has internet access, where each router broadcasts a fixed coverage radius. A building is considered covered as long as it falls within some router's coverage radius. Given the positions of the buildings in array A and the positions of the routers in array B along a street, work out the smallest coverage radius the routers need so that every building ends up covered. Keep in mind that every router shares the same coverage standard, so all routers use the identical radius. Input Format: First Argument is an Integer Array A, denoting the positions of buildings on the street. Second Argument is an Integer Array B, denoting the routers on the street. Output Format: Return an integer denoting the minimum coverage radius needed for the routers so that all buildings can be covered. Examples Example 1: Input: A = [5, 5, 7], B = [5] Output: 2 Explanation: Wi