Intervals Quiz
Editorial
13 questions across the three Intervals lessons: merging, inserting and intersecting, touching under both conventions, choosing by end, and counting rooms. Pick an answer to see whether it's right and why. Nothing is saved, so you can take it again.
If one trips you up, its lesson is Introduction to Intervals, Interval Scheduling: Sort by End Time or Counting Overlaps with a Sweep Line.
Quiz
1 / 13Multiple choice
Merge Intervals on [[2, 6], [1, 3], [8, 10], [9, 9]]?
Multiple choice
Meetings [3, 7) and [7, 9), where a room is free at a meeting's end time. Is one room enough?
Multiple choice
Insert [4, 8] into [[1, 2], [3, 5], [6, 7], [9, 10]]?
Multiple choice
Interval List Intersections of [[1, 3], [5, 9]] and [[2, 6], [8, 12]]?
Multiple choice
The most meetings one room can hold from [[1, 3], [2, 4], [3, 5], [5, 7]], touching allowed?
Multiple choice
Non-overlapping Intervals on [[1, 4], [2, 3], [3, 4]]: how many must go?
Multiple choice
Shortest first on [[1, 6], [5, 8], [7, 12]]: how many does it keep?
Multiple choice
Maximum Number of Events on [[1, 2], [1, 2], [1, 2]]?
Multiple choice
Rooms needed for [[0, 4], [1, 2], [2, 3], [3, 5]], a room free at a meeting's end?
Multiple choice
The same four meetings, but a meeting still holds its room at its end time?
Multiple choice
In the heap version of Meeting Rooms II, when does a new room open?
Multiple choice
Minimum Interval to Include Each Query: intervals [[1, 4], [2, 3]] and the query 3?
Multiple choice
Every job [start, end] must run, each machine one job at a time. The fewest machines is: