Maximum Team Size

Problem Statement

Maximum Team Size Problem Description Given n employees, the time when the i -th employee starts working is represented by the array startTime[i] and the time when they finish the work is represented by the array endTime[i] . The i -th employee can interact with the P -th employee if their working hours overlap. A team can only be formed if at least one employee of the team can interact with all other team members. Determine the maximum size of such a team. Function Description Complete the function getMaximumTeamSize in the editor with the following parameter(s): int n : the number of employees int startTime[] : an array representing the start times of employees' work int endTime[] : an array representing the end times of employees' work Returns int : the maximum possible team size Examples Example 1: Input: n = 4 startTime = [2, 5, 6, 8] endTime = [3, 6, 10, 9] Output: 3 Explanation: The working hours are: Employee 0: [2,3], Employee 1: [5,6], Employee 2: [6,10], Employee 3: [8,9]. C