Solution: Reschedule Meetings for Maximum Free Time I

Statement

You are given an event that runs from time $0$ to time eventTime. There are n non overlapping meetings scheduled during the event, where the ith meeting occupies the half open interval [startTime[i], endTime[i]).

You may reschedule at most k meetings. Rescheduling a meeting means choosing a new half open interval of the same duration that lies entirely within $[0,$ ...