< Summary

Information
Class: LeetCode.Algorithms.SumOfAllOddLengthSubarrays.SumOfAllOddLengthSubarraysBruteForce
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\SumOfAllOddLengthSubarrays\SumOfAllOddLengthSubarraysBruteForce.cs
Line coverage
100%
Covered lines: 18
Uncovered lines: 0
Coverable lines: 18
Total lines: 47
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
SumOddLengthSubarrays(...)100%88100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\SumOfAllOddLengthSubarrays\SumOfAllOddLengthSubarraysBruteForce.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.SumOfAllOddLengthSubarrays;
 13
 14/// <inheritdoc />
 15public class SumOfAllOddLengthSubarraysBruteForce : ISumOfAllOddLengthSubarrays
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n^3)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="arr"></param>
 22    /// <returns></returns>
 23    public int SumOddLengthSubarrays(int[] arr)
 324    {
 325        var sum = 0;
 26
 2627        for (var start = 0; start < arr.Length; start++)
 1028        {
 6829            for (var end = start; end < arr.Length; end++)
 2430            {
 2431                var length = end - start + 1;
 32
 2433                if (length % 2 != 1)
 934                {
 935                    continue;
 36                }
 37
 8438                for (var i = start; i <= end; i++)
 2739                {
 2740                    sum += arr[i];
 2741                }
 1542            }
 1043        }
 44
 345        return sum;
 346    }
 47}