Problem · Array
Meeting Room Scheduler
● Medium
AmazonFULLTIMEPHONE SCREEN
See Amazon hiring insightsAmazonFULLTIMEPHONE SCREENProblem statement
Implement a scheduler for roomCount meeting rooms numbered from 0 to roomCount - 1.
Each row meetings[i] = [start, end] is a request for the half-open interval [start, end). Requests appear in nondecreasing start order and are processed in input order. Assign the lowest-numbered available room. If every room overlaps the request, reject it with -1.
The problem statement continues
ProExamples
Example 1
roomCount = 2meetings = [[0,10],[5,7],[10,12],[10,15]]return = [0,1,0,1]The first two requests occupy rooms 0 and 1. At time 10, both are free; input order gives the third request room 0 and the fourth room 1.
FastPrep Pro
Reported in 1 Amazon interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 2 more worked examples, explained
- Guided hints and editorial
- Run your code on real test cases
$8.25/month
$99 billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week