You are given an integer eventTime representing the total duration of an event on a timeline from $0$ to eventTime. You are also given two integer arrays startTime and endTime of length n, representing n meetings where the $i^{ ext{th}}$ meeting takes place during the interval $[$startTime[i], endTime[i]$]$.

All meetings are initially non overlapping and ordered chronologically.

You can reschedule at most $1$ meeting by changing its start time to any value $t$ such that:

1. The meeting’s duration, endTime[i] $-$ startTime[i], remains unchanged.

2. The rescheduled meeting lies completely within the event interval $[0,$ eventTime$]$.

3. The rescheduled meeting does not overlap with any of the remaining $n - 1$ meetings, which stay in their original positions.

Return the maximum continuous free time possible during the event after rescheduling at most $1$ meeting.

Note: Continuous free time is any interval of time within $[0,$ eventTime$]$ where no meeting is taking place.

Constraints:

• $1 \leq$ eventTime $\leq 10^9$

• n $==$ startTime.length $==$ endTime.length

• $2 \leq$ n $\leq 10^5$

• $0 \leq$ startTime[i] $<$ endTime[i] $\leq$ eventTime

• endTime[i] $\leq$ startTime[i + 1] for all i in the range $[0, n - 2]$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.