Meeting Rooms / Minimum Buses for Schedule

Problem Overview

Given a list of bus schedules, each represented as a (departure_time, arrival_time) pair, find the minimum number of buses needed to serve all schedules (i.e., the minimum number of buses such that no two overlapping schedules share the same bus). Follow-up: each schedule also includes a departure station and an…

• 1 candidate-reported follow-up — the exact probes interviewers asked, with the trigger for each
• The rest of the problem statement — full requirements, constraints, and edge cases
• Approach and trade-offs — what passing candidates did, and the mistakes that sink people