My Calendar I — LeetCode 729 Python Solution

The problem

You are implementing a program to use as your calendar. We can add a new event if adding the event will not cause a double booking.

Example

Input

["MyCalendar", "book", "book", "book"]

Output

[null, true, false, true]

Explanation

MyCalendar myCalendar = new MyCalendar();

Python solution

class MyCalendar:

    def __init__(self):
        self.sd = SortedDict()

    def book(self, start: int, end: int) -> bool:
        idx = self.sd.bisect_right(start)
        if idx < len(self.sd) and self.sd.values()[idx] < end:
            return False
        self.sd[end] = start
        return True


# Your MyCalendar object will be instantiated and called as such:
# obj = MyCalendar()
# param_1 = obj.book(start,end)

Complexity

Pattern: Monotonic Stack

Answer "what is the next greater element" for every position in one pass. LeetCode 729. My Calendar I is filed here because the reference solution below belongs to the algorithm family this hub collects, even though its LeetCode tags point elsewhere.

The monotonic stack guide has the Python template for the pattern and the 225 LeetCode problems that use it.

Related problems