Team Formation

Problem Overview

• Build the largest team of developers so each member’s limits on teammates with lower and higher skill are respected.
• Input: n, arrays lowerSkill[i] and higherSkill[i]. Output: maximum feasible team size.
• Reflects real-world team formation where developers prefer certain seniority mixes.
• Classic coding interview problem and practical interview question focused on constraint-based selection.