Concurrent shift overlap
Two delivery drivers log their shifts for the week as minute intervals [start, end], each occupying the half-open span [start, end). Each driver's own shifts never overlap, but the lists are unsorted. Return the total number of minutes during which both drivers were on duty at the same time. Example: driver A [[0,60],[120,180]] and driver B [[30,150]] share 60 minutes.
Implement
shared_on_duty_minutes(a: list[list[int]], b: list[list[int]]) → intExamples
in
[[[0,60],[120,180]],[[30,150]]]out60What 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,60],[120,180]],[[30,150]]]60not run yetsample