< Summary

Information
Class: LeetCode.Algorithms.AlternatingGroups2.AlternatingGroups2SlidingWindow
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\AlternatingGroups2\AlternatingGroups2SlidingWindow.cs
Line coverage
100%
Covered lines: 19
Uncovered lines: 0
Coverable lines: 19
Total lines: 49
Line coverage: 100%
Branch coverage
100%
Covered branches: 6
Total branches: 6
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
NumberOfAlternatingGroups(...)100%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\AlternatingGroups2\AlternatingGroups2SlidingWindow.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.AlternatingGroups2;
 13
 14/// <inheritdoc />
 15public class AlternatingGroups2SlidingWindow : IAlternatingGroups2
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n + k)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="colors"></param>
 22    /// <param name="k"></param>
 23    /// <returns></returns>
 24    public int NumberOfAlternatingGroups(int[] colors, int k)
 325    {
 326        var count = 1;
 327        var result = 0;
 28
 5229        for (var i = 0; i < colors.Length - 1 + k - 1; i++)
 2330        {
 2331            if (colors[i % colors.Length] != colors[(i + 1) % colors.Length])
 1732            {
 1733                count++;
 1734            }
 35
 36            else
 637            {
 638                count = 1;
 639            }
 40
 2341            if (count >= k)
 542            {
 543                result++;
 544            }
 2345        }
 46
 347        return result;
 348    }
 49}