Count Maximum Teams | AMAZON SDE | Online Assessment

In this coding challenge, we have a bunch of coders taking part in a competition; each coder has a certain skill level represented as skill[i].

To make the contest fair, the organizers have decided to create teams of a specific size, called teamSize; each team will comprise this exact number of coders.

However, they also need to make sure that the variation in skills within each team isn't too big, so they have set a rule: the gap between the highest skill and the lowest skill in a team can't go beyond a certain limit, which is maxDiff. Now, the question here is to figure out what's the greatest number of teams we can form from all the coders while respecting these rules.

Example

• skill = [3, 4, 3, 1, 6, 5], teamSize = 3, maxDiff = 2:
• At most, 2 teams can be formed: [3, 3, 1] and [4, 6, 5]. The difference between the maximum and minimum skill levels is 2 in each case, which does not exceed the threshold value of 2.

From this question what can we contextualize?

1. It's an array question i.e skills array
2. We are looking for a solution in certain window i.e team size
3. do we need a sliding window technique?
4. we a have window of team size
5. once we have a team, we slide the window to form a next team
6. Also since it's an array question do we need to sort it out?
7. yes cause we need to make sure highest skilled person - least skilled <= difference

function teams(skill, size, diff) {
  // Sort the skill array
  let skills = skill.sort((a, b) => a - b);
   
  let totalTeams = 0;
   
  for (let i = 0; i < skills.length; i++) {
     // Check if there's enough room for a full team 
     // and the team satisfies the condition
     // also i needs to be in bound of index
    if (i + size - 1 < skills.length && skills[i + size - 1] - skills[i] <= diff) {
     // It's a valid team
      totalTeams++;
       
      // Skip the team
      i += size - 1;
    }
  }
   
  return totalTeams;
}