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

The Number of the Smallest Unoccupied Chair

Understand how to apply heap patterns to solve scheduling problems by tracking the smallest available chair in a dynamic scenario. This lesson guides you through analyzing arrival and departure times to determine seat allocation efficiently using C#.

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, ...