Leetcode 3439. Reschedule Meetings for Maximum Free Time I
Given non-overlapping meetings inside [0, eventTime], you may shift up to k meetings (keeping each meeting's duration and the relative order, and staying within the event) to maximize the length of the longest continuous free interval; return that maximum gap. n can be up to 1e5, so an O(n)–O(n log n) strategy (sliding window / DP on intervals) is needed.
Asked at:
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
Early December, 2024
Mid-level
Reschedule k meetings to find maximum break time. Given n presenters scheduled from time 0 to t, with start and finish times for each meeting, rearrange up to k meetings to maximize the longest break period. Cannot change the order of events.
Hello Interview Premium
Your account is free and you can post anonymously if you choose.