Company: Uber_14july
Difficulty: medium
Academic Decathlon Problem Description Students are being selected for an academic decathlon team at a school. Each student has a skill level, and for a team to be uniform, the difference between any two consecutive skill levels (when arranged in increasing order) must be either 0 or 1. Your task is to find the maximum possible team size. Complete the function `findMaxTeamSize` in the editor with the following parameters: `int skills[n]`: the skill levels of each student Returns: `int`: the maximum possible size of the team int findMaxTeamSize(vector<int> skills) { } Examples Example 1: Input: skills = [4, 13, 2, 3] Output: 3 Explanation: There are two valid teams possible: (2, 3, 4) and (13). These have team sizes of 3 and 1, respectively. The maximum team size is 3. Constraints 1 <= n <= 10^5 1 <= skills[i] <= 10^9