Problem Statement

Efficient Teams 2 Problem Description A firm has 2n employees, where the i th employee has an efficiency equal to i (for i = 1, 2, ..., 2n ). The firm wants to organize these employees into n teams of 2 members each, with each employee assigned to exactly one team. There are two types of tasks that teams can perform: Task Type 1: The team's efficiency is the minimum efficiency of its two members. Task Type 2: The team's efficiency is the maximum efficiency of its two members. The firm selects x ( 0 <= x <= n ) teams to perform Task Type 1 and assigns the remaining n - x teams to Task Type 2. The goal of the firm is to make the efficiency of each n team (0-based index) equal to totalEfficiency[i] . Determine the number of possible values for x ( 0 <= x <= n ) for which the target efficiency list totalEfficiency can be achieved. For each x , the firm can freely choose how to pair employees to form teams. Function Description Complete the function getPossibleCount in the edito