Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in C++

The Number of the Smallest Unoccupied Chair

Explore how to apply heap data structures to solve the problem of assigning the smallest unoccupied chair to friends arriving and leaving at different times. This lesson helps you understand event-driven chair allocation and implement an efficient coding solution for interview scenarios.

We'll cover the following...

Statement

At a party, nn friends, numbered from 00 to n−1n - 1, arrive and leave at different times. There are infinitely many chairs, numbered 00 onwards. Each arriving friend sits on the smallest available chair at that moment.

For example, if chairs 00, ...