Available question text
Given non-overlapping meetings within [0, eventTime], you may move at most one meeting (keeping its duration and staying inside the event, with no overlaps) to maximize the length of the longest continuous free time interval; return that maximum. With n up to 1e5 and times sorted, the challenge is to pick which interval to relocate and where to insert it to best create or merge gaps (prefix/suffix/gap analysis rather than brute force).
Related questions
Continue with questions that share topics or the same question type.
- Reschedule Meetings for Maximum Free Time I
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
No company association
Leetcode 3440. Reschedule Meetings for Maximum Free Time II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source