Earliest free time slot
You are given an unsorted list of busy intervals [start, end] — each occupying the half-open span [start, end) with nonnegative integer bounds — and a required duration d >= 1. Return the earliest nonnegative start time t such that the span [t, t + d) does not intersect any busy interval. Example: busy [[0,5],[7,9]] with d = 2 gives 5, since [5, 7) fits exactly between them.
Implement
earliest_free_slot(busy: list[list[int]], d: int) → intExamples
in
[[[0,5],[7,9]],2]out5What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 15 min
solution.py
InputExpectedGot
[[[0,5],[7,9]],2]5not run yetsample