Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Reschedule Meetings for Maximum Free Time II
Coding
- Employee Free Time
Coding
- Given an array nums and a sliding window of size k moving from the very left to the very right, return the maximum value in the window for each position. Solve in O(n) time using a deque.
Coding
- Maximum Running Time of N Computers
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Google
Leetcode 3439. Reschedule Meetings for Maximum Free Time I
Reported Dec 8, 2024 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source