729. My Calendar I | balanced trees | Leetcode Daily Challenge | DSA | Java

Problem Name:
729. My Calendar I

Problem Statement:
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.

A double booking happens when two events have some non-empty intersection (i.e., some moment is common to both events.).

The event can be represented as a pair of integers start and end that represents a booking on the half-open interval [start, end), the range of real numbers x such that start = x end.

Implement the MyCalendar class:

MyCalendar() Initializes the calendar object.
boolean book(int start, int end) Returns 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.

Problem Link:

Solution Link:

Graph Playlist:

Java Plus DSA Placement Course Playlist:

Java Plus DSA Sheet:

Notes:

Telegram Link:

Ultimate Recursion Series Playlist:

Samsung Interview Experience:

Company Tags:
Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe | Samsung

Timestamp:
0:00 - Introduction

#ShashwatTiwari #coding​​ #problemsolving​

[anshdeepbansal]

Bhaiya....I got a summer internship offer from Microsoft
I followed your daily challenge videos because you explains really well...and just wanted to thank you ❤

[PiyushSharma-weyd]

first bhaiya, mai just solve krke aya, maine bhi treemap use kra tha

[nitishyadav]

bhaiya ye methods, lowerKey type ye yad hone chahiye phle se interview ke time per? ya puch sakte h ?