My Calendar I

Design a data structure that supports booking half-open intervals [start, end) so that book(start, end) returns true and inserts the interval only if it causes no overlap with existing bookings (otherwise returns false). With up to 1000 calls and times in [0, 1e9], typical solutions check neighbors in a sorted list or use a BST to detect overlaps efficiently.