Formatted question description:




Implement a MyCalendar class to store your events. A new event can be added if adding the event will not cause a double booking.

Your class will have the method, book(int start, int end). Formally, this represents a booking on the half open interval [start, end), the range of real numbers x such that start <= x < end.

A double booking happens when two events have some non-empty intersection (ie., there is some time that is common to both events.)

For each call to the method, return true if the event can be added to the calendar successfully without causing a double booking. Otherwise, return false and do not add the event to the calendar.

Your class will be called like this: MyCalendar cal = new MyCalendar();, end)

Example 1:

MyCalendar();, 20); // returns true, 25); // returns false, 30); // returns true
The first event can be booked.  The second can't because time 15 is already booked by another event.
The third event can be booked, as the first event takes every time less than 20, but not including 20.


  • The number of calls to per test case will be at most 1000.
  • In calls to, end), start and end are integers in the range [0, 10^9].


Use a list to store the intervals of booking, which contains all intervals in sorted order. Each time book(int start, int end) is called, loop over the list of intervals to see whether the new interval [start, end) can be added.

If the new interval can be added at the start or at the end without causing a double booking, add the new interval at the start or at the end and return true.

If the new interval can be added between two intervals without causing a double booking, add the new interval between the two intervals and return true.

If the new interval has intersection with any interval in the list, then adding the interval will cause double booking, so return false.


  • import java.util.TreeMap;
    public class My_Calendar_I {
        public static void main (String[] args) {
            My_Calendar_I out = new My_Calendar_I();
            MyCalendar c = MyCalendar();
    //        System.out.println(,29));
    //        System.out.println(,22));
    //        System.out.println(,50));
    //        System.out.println(,7));
    //        System.out.println(,10));
    //        System.out.println(,20));
    //        System.out.println(,25));
    //        System.out.println(,42));
    //        System.out.println(,50));
            // test on TreeMap
            TreeMap<Integer, Integer> tm = new TreeMap<>();
            tm.put(3, 10);
            tm.put(5, 110);
            tm.put(7, 150);
            System.out.println(tm.ceilingKey(4)); // output: 5
            System.out.println(tm.floorKey(4)); // output: 3
            System.out.println(tm.floorKey(1)); // output: null
            // @memorize: cannot use `int`, should use `Integer`
            int floor = tm.floorKey(1);
            System.out.println(floor); // output: java.lang.NullPointerException
        // ref:
        class MyCalendar {
            // each element is start->end pair
            TreeMap<Integer, Integer> startEndMap;
            public MyCalendar() {
                startEndMap = new TreeMap<>();
            public boolean book(int start, int end) {
                // Returns the greatest key less than or equal to the given key, or null
                Integer prevStart = startEndMap.floorKey(start); // @note: Integer, not int, for later null check
                // Returns the least key greater than or equal to the given key, or null
                Integer nextStart = startEndMap.ceilingKey(start);
                if (
                        (prevStart == null || startEndMap.get(prevStart) <= start) // get will return end date
                        && (nextStart == null || end <= nextStart)
                   ) {
                    startEndMap.put(start, end);
                    return true;
                return false;
     * Your MyCalendar object will be instantiated and called as such:
     * MyCalendar obj = new MyCalendar();
     * boolean param_1 =,end);
  • // OJ:
    // Time:
    //      MyCalendar: O(1)
    //      book: O(logN)
    // Space: O(N)
    class MyCalendar {
        map<int, int> m;
        MyCalendar() {}
        bool book(int start, int end) {
            if (m.empty()) {
                m[start] = end;
                return true;
            auto it = m.upper_bound(start);
            if (it != m.begin() && prev(it)->second > start) return false;
            if (it != m.end() && it->first < end) return false;
            m[start] = end;
            return true;
  • class Node(object):
        def __init__(self, s, e):
            self.s = s
            self.e = e
            self.left = None
            self.right = None
    class MyCalendar(object):
        def __init__(self):
            self.root = None
        def book_helper(self, s, e, node):
            if node.e <= s:
                if node.right:
                    return self.book_helper(s, e, node.right)
                    node.right = Node(s, e)
                    return True
            elif node.s >= e:
                if node.left:
                    return self.book_helper(s, e, node.left)
                    node.left = Node(s, e)
                    return True
                return False
        def book(self, start, end):
            :type start: int
            :type end: int
            :rtype: bool
            if not self.root:
                self.root = Node(start, end)
                return True
                return self.book_helper(start, end, self.root)
    # Your MyCalendar object will be instantiated and called as such:
    # obj = MyCalendar()
    # param_1 =,end)

All Problems

All Solutions