Intermediate · Coding interviews: heaps, recursion and intervals
Intervals
Six interview problems on spans of time and number: an interval inserted into a sorted list, where two schedules meet, the fewest meetings to cancel, a calendar that refuses double bookings, everyone's free time, and the smallest interval that holds each query.
- You build
- insert.py, then meet.py, then remove.py, then bookings.py, then free.py, then queries.py
- Stages
- 6 Problems
- Time
- About 2 hours
Loading the workspace…
Loading the workspace…