Minimize Scheduling Headaches: Clone Yourself for Overlapping Events | Hard
Complete Article - https://tutorialhorizon.com/algorithm...
Problem Statement
You have a calendar with n events, each defined by a start time and a finish time. Some events may overlap, making it impossible for a single person to attend all of them. To ensure that every event is attended, you need to create k clones of yourself. Each clone can attend a subset of non-overlapping events. The objective is to minimize the number of clones required to cover all events.
Example 1:
Events: [(1, 3),(2, 5),(4, 6)]
Output: 2
Clone 1 - (1, 3) and (4, 6).
Clone 2 - (2, 5)
#algorithm #interview #coding #array #hard #scheduling