< Summary

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

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\BinarySubarraysWithSum\BinarySubarraysWithSumDictionary.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.BinarySubarraysWithSum;
 13
 14/// <inheritdoc />
 15public class BinarySubarraysWithSumDictionary : IBinarySubarraysWithSum
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(n)
 20    /// </summary>
 21    /// <param name="nums"></param>
 22    /// <param name="goal"></param>
 23    /// <returns></returns>
 24    public int NumSubarraysWithSum(int[] nums, int goal)
 225    {
 226        var sumDictionary = new Dictionary<int, int> { [0] = 1 };
 27
 428        int currentSum = 0, count = 0;
 29
 2630        foreach (var num in nums)
 1031        {
 1032            currentSum += num;
 33
 1034            if (sumDictionary.ContainsKey(currentSum - goal))
 835            {
 836                count += sumDictionary[currentSum - goal];
 837            }
 38
 1039            if (!sumDictionary.TryAdd(currentSum, 1))
 740            {
 741                sumDictionary[currentSum]++;
 742            }
 1043        }
 44
 245        return count;
 246    }
 47}