You are given two $0$ indexed integer arrays, startTime and endTime, both of length n, representing the active time intervals of n candidates. The $i^{ ext{th}}$ candidate is active during the inclusive time range $[$startTime[i], endTime[i]$]$.

A candidate can form a team consisting of themselves and any other candidates whose active intervals overlap with their own interval. Two intervals overlap if they share at least one common unit of time.

Return an integer denoting the maximum team size that can be formed by any candidate.

Constraints:

• $1 \leq$ n $==$ startTime.length $==$ endTime.length $\leq 10^5$

• $0 \leq$ startTime[i] $\leq$ endTime[i] $\leq 10^9$

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.