Non-overlapping windows
A courier's assigned delivery windows for one day are given as [start, end] pairs in minutes; the courier is occupied for the half-open span [start, end). The list is unsorted. Return True if a single courier can work all of them, i.e. no two windows overlap. Back-to-back windows, where one ends exactly as the next begins, are fine. Example: [[30,75],[0,30],[75,90]] is True.
Implement
can_handle_all(windows: list[list[int]]) → boolExamples
in
[[[30,75],[0,30],[75,90]]]outtrueWhat 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 11 min
solution.py
InputExpectedGot
[[[30,75],[0,30],[75,90]]]truenot run yetsample