< Summary

Information
Class: LeetCode.Algorithms.ThreeConsecutiveOdds.ThreeConsecutiveOddsCounting
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\ThreeConsecutiveOdds\ThreeConsecutiveOddsCounting.cs
Line coverage
100%
Covered lines: 17
Uncovered lines: 0
Coverable lines: 17
Total lines: 46
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
ThreeConsecutiveOdds(...)100%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\ThreeConsecutiveOdds\ThreeConsecutiveOddsCounting.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.ThreeConsecutiveOdds;
 13
 14/// <inheritdoc />
 15public class ThreeConsecutiveOddsCounting : IThreeConsecutiveOdds
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="arr"></param>
 22    /// <returns></returns>
 23    public bool ThreeConsecutiveOdds(int[] arr)
 224    {
 225        var count = 0;
 26
 2927        foreach (var item in arr)
 1228        {
 1229            if (item % 2 == 0)
 630            {
 631                count = 0;
 632            }
 33            else
 634            {
 635                count++;
 36
 637                if (count == 3)
 138                {
 139                    return true;
 40                }
 541            }
 1142        }
 43
 144        return false;
 245    }
 46}