Maximum Team Size Based on Overlapping Working Hours

Problem Statement

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 j 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. Example n = 5 startTime = [1, 6, 4, 3, 1] endTime = [2, 7, 5, 8, 2] Consider the group [1, 2, 3]. Employee 3 can interact with other employees in the group, so a team of size 3 is possible. A team with more than 3 employees is impossible. Therefore, the answer is 3. Function Description Complete the function getMaximumTeamSize in the editor with the following parameter(s):      int startTime[n] : the start times of employees' work      int endTime[n] : the end times of employees' work Returns      int : the maximu