## Hotel Coverage

Solutions This problem falls into the greedy category.
A hotel can accomodate all customers in a distance of \(-k\) and \(+k\). We should find the smallest amount of intervals of length \(2k\) that cover all the positions of the customers.
First of all, we sort the positions of the customers.
We iterate over all the sorted positions and, at each step, we calculate the difference between adjacent positions. We keep track of the interval by incrementing a running sum of the such differences.
[Read More]