Company: citadel_3oct
Difficulty: medium
Optimal Team Size Problem Description There are n developers. The skill level of the i th developer is given by i , for 1 ≤ i ≤ n . The task is to form a team of developers for a hackathon. A developer agrees to be on the team only if certain conditions are met. Given two arrays, lowerSkill and higherSkill , the i th developer will join the team if at most lowerSkill[i] team members have a lower skill level than them, and at most higherSkill[i] team members have a higher skill level than them. The objective is to select the largest possible team such that every developer on the team agrees with the team composition based on these conditions. Function Description Complete the function getOptimalTeamSize in the editor below. Function Parameters: int lowerSkill[n] : the maximum number of team members in the hackathon whose skill level is lower than the i th developer int higherSkill[n] : the maximum number of team members in the hackathon whose skill level is higher than the i th de