Dsa
Binary Search
Medium
Meeting Room Reservation
A company has multiple meeting rooms with assigned booking intervals. Given a list of booked intervals, determine if a new meeting can be scheduled without overlapping any existing bookings. Return 'Yes' if possible, 'No' otherwise.
Input format:
- The first line contains an integer n, the number of booked intervals.
- The second line contains n pairs of integers representing booked intervals (start and end times).
- The third line contains two integers representing the new meeting's start and end time.
Output format:
- Print 'Yes' or 'No'.
Example:
Input:
3
1 2
3 4
5 6
2 3
Output:
Yes
Key concepts
binary_searchintervalsscheduling
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now