< Summary

Information
Class: LeetCode.Algorithms.SpecialArray2.SpecialArray2BruteForce
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\SpecialArray2\SpecialArray2BruteForce.cs
Line coverage
100%
Covered lines: 17
Uncovered lines: 0
Coverable lines: 17
Total lines: 48
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
IsArraySpecial(...)100%22100%
IsArraySpecial(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\SpecialArray2\SpecialArray2BruteForce.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.SpecialArray2;
 13
 14/// <inheritdoc />
 15public class SpecialArray2BruteForce : ISpecialArray2
 16{
 17    /// <summary>
 18    ///     Time complexity - O(m * n)
 19    ///     Space complexity - O(m)
 20    /// </summary>
 21    /// <param name="nums"></param>
 22    /// <param name="queries"></param>
 23    /// <returns></returns>
 24    public bool[] IsArraySpecial(int[] nums, int[][] queries)
 225    {
 226        var result = new bool[queries.Length];
 27
 1028        for (var i = 0; i < queries.Length; i++)
 329        {
 330            result[i] = IsArraySpecial(nums, queries[i][0], queries[i][1]);
 331        }
 32
 233        return result;
 234    }
 35
 36    private static bool IsArraySpecial(int[] nums, int start, int end)
 337    {
 1638        for (var i = start; i < end; i++)
 739        {
 740            if (nums[i] % 2 == nums[i + 1] % 2)
 241            {
 242                return false;
 43            }
 544        }
 45
 146        return true;
 347    }
 48}