Search
Hotel Bookings Possible Interviewbit Solution
Updated: Sep 8, 2020
Problem: Hotel Bookings Possible
Problem Description:
A hotel manager has to process N advance bookings of rooms for the next season. His hotel has C rooms. Bookings contain an arrival date and a departure date. He wants to find out whether there are enough rooms in the hotel to satisfy the demand. Write a program that solves this problem in time O(N log N).
Input Format
First argument is an integer array A containing arrival time of booking.
Second argument is an integer array B containing departure time of booking.
Third argument is an integer C denoting the count of rooms.Output Format
Return True if there are enough rooms for N bookings else return False.
Return 0/1 for C programs.Example Input
Input 1:
A = [1, 3, 5] B = [2, 6, 8] C = 1Example Output
Output 1:
0Example Explanation
Explanation 1:
At day = 5, there are 2 guests in the hotel. But I have only one room.Solution:
https://elegicasino.com is where I've noticed how a simple capacity limit shapes everything, and that's exactly what makes this problem click—the day 5 overlap in the example is a neat way to show why sorting arrivals and departures separately beats checking each booking one by one. I've seen this pattern before in scheduling tasks, and treating arrivals as +1 and departures as -1 in a merged timeline makes the room count almost obvious.