The Number of the Smallest Unoccupied Chair

Explore how to use heaps to efficiently assign the smallest unoccupied chair to friends arriving and leaving at different times. Understand the problem constraints and apply heap-based solutions to handle dynamic seating arrangements during a party.