< Summary

Information
Class: LeetCode.Algorithms.MaximumDifferenceBetweenEvenAndOddFrequency1.MaximumDifferenceBetweenEvenAndOddFrequency1FrequencyArray
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MaximumDifferenceBetweenEvenAndOddFrequency1\MaximumDifferenceBetweenEvenAndOddFrequency1FrequencyArray.cs
Line coverage
100%
Covered lines: 23
Uncovered lines: 0
Coverable lines: 23
Total lines: 55
Line coverage: 100%
Branch coverage
100%
Covered branches: 8
Total branches: 8
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
MaxDifference(...)100%88100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MaximumDifferenceBetweenEvenAndOddFrequency1\MaximumDifferenceBetweenEvenAndOddFrequency1FrequencyArray.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.MaximumDifferenceBetweenEvenAndOddFrequency1;
 13
 14/// <inheritdoc />
 15public class MaximumDifferenceBetweenEvenAndOddFrequency1FrequencyArray :
 16    IMaximumDifferenceBetweenEvenAndOddFrequency1
 17{
 18    /// <summary>
 19    ///     Time complexity - O(n)
 20    ///     Space complexity - O(1)
 21    /// </summary>
 22    /// <param name="s"></param>
 23    /// <returns></returns>
 24    public int MaxDifference(string s)
 225    {
 226        var frequencyArray = new int['z' - 'a' + 1];
 27
 3828        foreach (var c in s)
 1629        {
 1630            frequencyArray['z' - c]++;
 1631        }
 32
 233        var oddFrequency = int.MinValue;
 234        var evenFrequency = int.MaxValue;
 35
 11036        foreach (var frequency in frequencyArray)
 5237        {
 5238            if (frequency == 0)
 4639            {
 4640                continue;
 41            }
 42
 643            if (frequency % 2 == 0)
 244            {
 245                evenFrequency = Math.Min(evenFrequency, frequency);
 246            }
 47            else
 448            {
 449                oddFrequency = Math.Max(oddFrequency, frequency);
 450            }
 651        }
 52
 253        return oddFrequency - evenFrequency;
 254    }
 55}

Methods/Properties

MaxDifference(System.String)