Academic Decathlon

Problem Statement

Academic Decathlon Problem Description Students are being selected for an academic decathlon team. A team is selected by choosing a start level and a size 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 which takes an array of integers skills representing the skill levels of each student and should return an integer representing the maximum possible size of the team. 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 possible team size is 3. Example 2: Input: skills = [10, 12, 13, 9, 14] Output: 3 Explanation: Valid teams, sorted are {9, 10}, and {12, 13, 14}. These teams have team sizes 2 and 3, respectively, so the maximum team size is 3. Constraints 1 ≤ n ≤ 10