LeetCode 732: My Calendar III
Problem Restatement We need to implement a calendar. Each event is a half-open interval: [start, end) A new event can always be added. After each booking, we must return the largest number of events that overlap at any time. This value is called the maximum k -booking. A k -booking means there is some non-empty time interval where k events are active at the same time. The official problem defines...