Problem Statement

Optimal Team Size Problem Description There are n developers, and the i th developer's skill level is exactly i , for 1 ≤ i ≤ n . You need to assemble a hackathon team from among them. Each developer has a personal condition for joining. You are given two arrays, lowerSkill and higherSkill : developer i will only join if the team ends up with at most lowerSkill[i] members whose skill is lower than theirs, and at most higherSkill[i] members whose skill is higher than theirs. You want to build the biggest team possible in which every single member's condition is satisfied by the final roster. 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 developer Returns: int : the maximum number of develop