Efficient Team Formation

Problem Statement

Efficient Team Formation Problem Description Count all possible strong team combinations. A team is strong if the number of weak players in any sub-array of size k is less than or equal to a threshold x . The team is represented by a string of length n where each character corresponds to a player. Task: Determine the number of unique non-empty substrings (teams) that qualify as strong teams based on the thresholds k and x . Complete the function `countEfficientFormations` in the editor below. The function is expected to return an INTEGER . The function accepts the following parameters: string team : the lineup of players, where each character corresponds to a player's unique attribute or skill. vector<bool> efficiencyArray : an array of booleans where efficiencyArray[i] is 1 or 0, indicating strong or weak players, respectively. int k : the size of the sub-array to check for weak players. int x : the maximum number of weak players allowed in any sub-array of size k for a team to