A hotel manager has to process N advance bookings of rooms for the next season. His hotel has K 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.
The idea is to sort the arrays and keep track of overlaps.
Input : Arrivals : [1 3 5] Departures : [2 6 8] K: 1 Output: False Hotel manager needs at least two rooms as the second and third intervals overlap.
The idea is store arrival and departure times in an auxiliary array with an additional marker to indicate whether the time is arrival or departure. Now sort the array. Process the sorted array, for every arrival increment active bookings. And for every departure, decrement. Keep track of maximum active bookings. If the count of active bookings at any moment is more than k, then return false. Else return true.
Below is the implementation of the above approach:
Time Complexity: O(n Log n)
Auxiliary Space: O(n)
The idea is to simply sort the 2 arrays (Array for arrival dates and Array for departure dates) first.
Now, the next step would be to check how many overlaps are present in one particular range. If the number of overlaps are greater than the number of rooms, we can say that we have less rooms to accommodate guests.
So, for a particular range where arrival date(ith of Arrival array) being the start date and departure date(ith of departure array) being the end date, overlap can be only possible if the next arrival dates(from i+1th) are less than end date of the range and greater than or equal to start date of the range (Since this is a sorted array, we don’t need to take care about the latter condition).
Considering the fact, that we have sorted array, we directly need to check if the next Kth (i+Kth) arrival date falls in the range, if it does, all the dates before that arrival date will also fall in the taken range, resulting in K+1 overlaps with the range in question, hence exceeding the number of rooms.
Following is the Implementation of above Approach –
Time Complexity: O(n Log n)
Auxiliary Space: O(n) used by Python sort
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Largest possible Subset from an Array such that no element is K times any other element in the Subset
- Possible values of Q such that, for any value of R, their product is equal to X times their sum
- Minimum LCM and GCD possible among all possible sub-arrays
- Find the maximum difference after applying the given operations two times on a number
- Find Nth smallest number that is divisible by 100 exactly K times
- Given count of digits 1, 2, 3, 4, find the maximum sum possible
- Find the Maximum possible Sum for the given conditions
- Maximum profit by buying and selling a share at most K times | Greedy Approach
- Find the maximum possible value of a[i] % a[j] over all pairs of i and j
- Construct the smallest possible Array with given Sum and XOR
- Number of times the largest perfect square number can be subtracted from N
- Maximum score after flipping a Binary Matrix atmost K times
- Smallest element in an array that is repeated exactly 'k' times.
- Lexicographically largest subsequence such that every character occurs at least k times
- Largest element in the array that is repeated exactly k times
- Encrypt a string by repeating i-th character i times
- Minimum deletions required such that any number X will occur exactly X times
- Longest increasing sub-sequence formed by concatenating array to itself N times
- Number of times an array can be partitioned repetitively into two subarrays with equal sum
- Check if two arrays can be made equal by reversing subarrays multiple times
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.