My Calendar III Problem [Solved with Segment Tree, Sweep Line]

In this article at OpenGenus, we have solved the Calendar 3 problem that is to find number of conflicting meetings in a given range of time. We have solved this using the concept of Sweep Line and Segment tree with Lazy Propagation.

Table of contents:

Problem DescriptionBrute Force solutionApproach 1: Sweep-line AlgorithmApproach 2: Segment tree with Lazy propagation

Learn:

Calendar 1 problemSweep-line AlgorithmSegment TreeSegment tree with Lazy propagationProblem Description

You are...