Minimum Light Radius - Google Top Interview Questions
Problem Statement :
You are given a list of integers nums representing coordinates of houses on a 1-dimensional line. You have 3 street lights that you can put anywhere on the coordinate line and a light at coordinate x lights up houses in [x - r, x + r], inclusive. Return the smallest r required such that we can place the 3 lights and all the houses are lit up. Constraints n ≤ 100,000 where n is the length of nums Example 1 Input nums = [3, 4, 5, 6] Output 0.5 Explanation If we place the lamps on 3.5, 4.5 and 5.5 then with r = 0.5 we can light up all 4 houses.
Solution :
Solution in C++ :
int need(vector<int>& v, double r) {
int ret = 0;
for (int i = 0; i < v.size();) {
ret++;
double upto = v[i] + 2 * r;
int j = i + 1;
while (j < v.size() && v[j] <= upto) j++;
i = j;
}
return ret;
}
double solve(vector<int>& nums) {
if (nums.size() == 0) return 0;
sort(nums.begin(), nums.end());
double lhs = 0;
double rhs = nums.back() - nums[0];
for (int qq = 0; qq < 40; qq++) {
double mid = (lhs + rhs) / 2;
if (need(nums, mid) <= 3)
rhs = mid;
else
lhs = mid;
}
return rhs;
}
Solution in Java :
import java.util.*;
class Solution {
int[] nums;
public double solve(int[] nums) {
if (nums.length <= 3)
return 0;
this.nums = nums;
Arrays.sort(nums);
int l = 0, r = nums[nums.length - 1];
while (l < r) {
int m = l + (r - l) / 2;
if (good(m)) {
r = m;
} else {
l = m + 1;
}
}
return (l + 0.0) / 2;
}
public boolean good(int range) {
int end = range + nums[0], ct = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] > end) {
ct++;
end = nums[i] + range;
}
}
return ct <= 2;
}
}
Solution in Python :
class Solution:
def solve(self, nums):
nums.sort()
N = len(nums)
if N <= 3:
return 0
LIGHTS = 3
def can(diameter):
start = nums[0]
end = start + diameter
for i in range(LIGHTS):
idx = bisect_right(nums, end)
if idx >= N:
return True
start = nums[idx]
end = start + diameter
return False
lo = -1
hi = nums[-1] - nums[0]
# Invariant: the answer lies in the interval (lo, hi]
while lo < hi - 1:
mid = (lo + hi) // 2
if can(mid):
hi = mid
else:
lo = mid
return hi / 2
View More Similar Problems
Unique Colors
You are given an unrooted tree of n nodes numbered from 1 to n . Each node i has a color, ci. Let d( i , j ) be the number of different colors in the path between node i and node j. For each node i, calculate the value of sum, defined as follows: Your task is to print the value of sumi for each node 1 <= i <= n. Input Format The first line contains a single integer, n, denoti
View Solution →Fibonacci Numbers Tree
Shashank loves trees and math. He has a rooted tree, T , consisting of N nodes uniquely labeled with integers in the inclusive range [1 , N ]. The node labeled as 1 is the root node of tree , and each node in is associated with some positive integer value (all values are initially ). Let's define Fk as the Kth Fibonacci number. Shashank wants to perform 22 types of operations over his tree, T
View Solution →Pair Sums
Given an array, we define its value to be the value obtained by following these instructions: Write down all pairs of numbers from this array. Compute the product of each pair. Find the sum of all the products. For example, for a given array, for a given array [7,2 ,-1 ,2 ] Note that ( 7 , 2 ) is listed twice, one for each occurrence of 2. Given an array of integers, find the largest v
View Solution →Lazy White Falcon
White Falcon just solved the data structure problem below using heavy-light decomposition. Can you help her find a new solution that doesn't require implementing any fancy techniques? There are 2 types of query operations that can be performed on a tree: 1 u x: Assign x as the value of node u. 2 u v: Print the sum of the node values in the unique path from node u to node v. Given a tree wi
View Solution →Ticket to Ride
Simon received the board game Ticket to Ride as a birthday present. After playing it with his friends, he decides to come up with a strategy for the game. There are n cities on the map and n - 1 road plans. Each road plan consists of the following: Two cities which can be directly connected by a road. The length of the proposed road. The entire road plan is designed in such a way that if o
View Solution →Heavy Light White Falcon
Our lazy white falcon finally decided to learn heavy-light decomposition. Her teacher gave an assignment for her to practice this new technique. Please help her by solving this problem. You are given a tree with N nodes and each node's value is initially 0. The problem asks you to operate the following two types of queries: "1 u x" assign x to the value of the node . "2 u v" print the maxim
View Solution →
