← All problems

3440. Reschedule Meetings for Maximum Free Time II

MediumOpen on LeetCodeProblem statement

Problem Statement

3440. Reschedule Meetings for Maximum Free Time II

Medium

You are given an integer eventTime denoting the duration of an event. You are also given two integer arrays startTime and endTime, each of length n.

These represent the start and end times of n non-overlapping meetings that occur during the event between time t = 0 and time t = eventTime, where the ith meeting occurs during the time [startTime[i], endTime[i]].

You can reschedule at most one meeting by moving its start time while maintaining the same duration, such that the meetings remain non-overlapping, to maximize the longest continuous period of free time during the event.

Return the maximum amount of free time possible after rearranging the meetings.

Note that the meetings can not be rescheduled to a time outside the event and they should remain non-overlapping.

Note: In this version, it is valid for the relative ordering of the meetings to change after rescheduling one meeting.

 

Example 1:

Input: eventTime = 5, startTime = [1,3], endTime = [2,5]

Output: 2

Explanation:

Reschedule the meeting at [1, 2] to [2, 3], leaving no meetings during the time [0, 2].

Example 2:

Input: eventTime = 10, startTime = [0,7,9], endTime = [1,8,10]

Output: 7

Explanation:

Reschedule the meeting at [0, 1] to [8, 9], leaving no meetings during the time [0, 7].

Example 3:

Input: eventTime = 10, startTime = [0,3,7,9], endTime = [1,4,8,10]

Output: 6

Explanation:

Reschedule the meeting at [3, 4] to [8, 9], leaving no meetings during the time [1, 7].

Example 4:

Input: eventTime = 5, startTime = [0,1,2,3,4], endTime = [1,2,3,4,5]

Output: 0

Explanation:

There is no time during the event not occupied by meetings.

 

Constraints:

Java

Source file
class Solution {
    public int maxFreeTime(int eventTime, int[] startTime, int[] endTime) {
        int n = startTime.length, tMax = startTime[0], ans = 0;
        int[] suffixMax = new int[n];
        suffixMax[n - 1] = eventTime - endTime[n - 1];
        for (int i = n - 1; i > 0; i--)
            suffixMax[i - 1] = Math.max(suffixMax[i], startTime[i] - endTime[i - 1]);
        for (int i = 1; i < n - 1; i++) {
            if (endTime[i] - startTime[i] <= Math.max(tMax, suffixMax[i + 1])) {
                ans = Math.max(ans, startTime[i + 1] - endTime[i - 1]); // unstable shift (changes relative ordering)
            } else
                ans = Math.max(ans, startTime[i] - endTime[i - 1] + startTime[i + 1] - endTime[i]); // simple slide
            tMax = Math.max(tMax, startTime[i] - endTime[i - 1]);
        }
        // consider flanks as well... added separately to prevent ArrayIndexOutOfBounds errors
        // System.out.println(Arrays.toString(suffixMax));
        // System.out.println(tMax);
        if (endTime[0] - startTime[0] <= suffixMax[1])
            ans = Math.max(ans, startTime[1]);
        else
            ans = Math.max(ans, startTime[0] - 0 + startTime[1] - endTime[0]);
        if (endTime[n - 1] - startTime[n - 1] <= tMax)
            ans = Math.max(ans, eventTime - endTime[n - 2]);
        else
            ans = Math.max(ans, startTime[n - 1] - endTime[n - 2] + eventTime - endTime[n - 1]);
        return ans;
    }
}