Meeting Room

Problem Overview

• Determine the minimum number of people who cannot meet when a single meeting room is assigned to N groups with given start/end times and group sizes.
• Input: N, arrays people[i], starting[i], ending[i]; Output: one integer count of people unable to meet.
• Meetings are inclusive; no overlap allowed; back-to-back only if end[i] < start[j].
• Real-world context: scheduling a shared office meeting room.
• A Wework interviews coding interview problem and common interview question.