< Summary

Information
Class: LeetCode.Algorithms.DividePlayersIntoTeamsOfEqualSkill.DividePlayersIntoTeamsOfEqualSkillSorting
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\DividePlayersIntoTeamsOfEqualSkill\DividePlayersIntoTeamsOfEqualSkillSorting.cs
Line coverage
100%
Covered lines: 20
Uncovered lines: 0
Coverable lines: 20
Total lines: 54
Line coverage: 100%
Branch coverage
100%
Covered branches: 4
Total branches: 4
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
DividePlayers(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\DividePlayersIntoTeamsOfEqualSkill\DividePlayersIntoTeamsOfEqualSkillSorting.cs

#LineLine coverage
 1// --------------------------------------------------------------------------------
 2// Copyright (C) 2025 Eugene Eremeev (also known as Yevhenii Yeriemeieiv).
 3// All Rights Reserved.
 4// --------------------------------------------------------------------------------
 5// This software is the confidential and proprietary information of Eugene Eremeev
 6// (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not
 7// disclose such Confidential Information and shall use it only in accordance with
 8// the terms of the license agreement you entered into with Eugene Eremeev (also
 9// known as Yevhenii Yeriemeieiv).
 10// --------------------------------------------------------------------------------
 11
 12namespace LeetCode.Algorithms.DividePlayersIntoTeamsOfEqualSkill;
 13
 14/// <inheritdoc />
 15public class DividePlayersIntoTeamsOfEqualSkillSorting : IDividePlayersIntoTeamsOfEqualSkill
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n log n)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="skill"></param>
 22    /// <returns></returns>
 23    public long DividePlayers(int[] skill)
 324    {
 325        Array.Sort(skill);
 26
 327        var left = 0;
 328        var right = skill.Length - 1;
 29
 330        var groupSum = skill[left] + skill[right];
 31
 332        long chemistry = skill[left] * skill[right];
 33
 334        left++;
 335        right--;
 36
 537        while (left < right)
 338        {
 339            var currentGroupSum = skill[left] + skill[right];
 40
 341            if (currentGroupSum != groupSum)
 142            {
 143                return -1;
 44            }
 45
 246            chemistry += skill[left] * skill[right];
 47
 248            left++;
 249            right--;
 250        }
 51
 252        return chemistry;
 353    }
 54}

Methods/Properties

DividePlayers(System.Int32[])