< Summary

Information
Class: LeetCode.Algorithms.CountSubarraysWhereMaxElementAppearsAtLeastKTimes.CountSubarraysWhereMaxElementAppearsAtLeastKTimesSlidingWindow
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\CountSubarraysWhereMaxElementAppearsAtLeastKTimes\CountSubarraysWhereMaxElementAppearsAtLeastKTimesSlidingWindow.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
CountSubarrays(...)100%88100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\CountSubarraysWhereMaxElementAppearsAtLeastKTimes\CountSubarraysWhereMaxElementAppearsAtLeastKTimesSlidingWindow.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.CountSubarraysWhereMaxElementAppearsAtLeastKTimes;
 13
 14/// <inheritdoc />
 15public class CountSubarraysWhereMaxElementAppearsAtLeastKTimesSlidingWindow :
 16    ICountSubarraysWhereMaxElementAppearsAtLeastKTimes
 17{
 18    /// <summary>
 19    ///     Time complexity - O(n)
 20    ///     Space complexity - O(1)
 21    /// </summary>
 22    /// <param name="nums"></param>
 23    /// <param name="k"></param>
 24    /// <returns></returns>
 25    public long CountSubarrays(int[] nums, int k)
 226    {
 227        var maxElement = nums.Max();
 28
 229        var count = 0;
 230        var start = 0;
 231        var maxElementsInWindow = 0;
 32
 2433        foreach (var num in nums)
 934        {
 935            if (num == maxElement)
 436            {
 437                maxElementsInWindow++;
 438            }
 39
 1340            while (k == maxElementsInWindow)
 441            {
 442                if (nums[start] == maxElement)
 243                {
 244                    maxElementsInWindow--;
 245                }
 46
 447                start++;
 448            }
 49
 950            count += start;
 951        }
 52
 253        return count;
 254    }
 55}