Question
Implement MyCalendarThree as a single function: given a chronological list of [start, end) booking requests, every request is accepted (overlaps allowed). After each booking, the 'k-booking' is the maximum number of bookings that overlap at any single point. Return a list whose i-th element is the maximum k-booking after the first i+1 bookings have been added. Times are in [0, 10^9) and there are up to 400 bookings.
calendar_three(bookings: list[list[int]]) → list[int][[[10,20],[50,60],[10,40],[5,15],[5,10],[25,55]]]out[1,1,2,3,3,3]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.
Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.