Leetcode 732. My Calendar III
Online interval insertions where after each [start, end) booking you must report the current maximum number of simultaneously overlapping events (the largest k such that k events intersect). Times can be up to 1e9 with ≤400 bookings, so the problem is solved by maintaining overlap counts incrementally (e.g., sweep-line with ordered map or segment tree/coordinate compression).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
Late July, 2026
There are 3 parts of the question. First is to sort the calendar events. Second is to identify overlaps and return overlap intervals. Third part is return alternating intervals of free and busy blocks.
Mid May, 2026
Create a calendar with some functions like add_event, list_events, get_overlapping_events, and get_free_periods which returned alternating busy/free blocks instead of actual events. Worked in 3 stages with each stage adding more complexity.
Hello Interview Premium
Your account is free and you can post anonymously if you choose.