← All topics
Quiz: Interval Problems: questions with answers
10 questions, each with the answer and a short explanation.
Take the timed quiz + get a certificate →- Q1. When do closed intervals [a1, b1] and [a2, b2] overlap?
- Q2. Why must intervals be sorted by start before merging?
- Q3. What does this print? (code)
- Q4. Inserting a new interval into a list that is already sorted and non-overlapping takes how long?
- Q5. For the minimum platforms problem, what does the running count represent?
- Q6. What does this print? (code)
- Q7. To choose the most non-overlapping meetings, how should you sort them?
- Q8. What does this print? (code)
- Q9. Why can arrivals and departures be sorted separately in the platforms problem?
- Q10. Two meetings are [1, 3] and [3, 5]. When should a program treat them as clashing?