< Summary

Information
Class: LeetCode.Algorithms.BinaryPrefixDivisibleByFive.BinaryPrefixDivisibleByFivePrefixModulo
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\BinaryPrefixDivisibleByFive\BinaryPrefixDivisibleByFivePrefixModulo.cs
Line coverage
100%
Covered lines: 10
Uncovered lines: 0
Coverable lines: 10
Total lines: 38
Line coverage: 100%
Branch coverage
100%
Covered branches: 2
Total branches: 2
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
PrefixesDivBy5(...)100%22100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\BinaryPrefixDivisibleByFive\BinaryPrefixDivisibleByFivePrefixModulo.cs

#LineLine coverage
 1// --------------------------------------------------------------------------------
 2// Copyright (C) 2026 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.BinaryPrefixDivisibleByFive;
 13
 14/// <inheritdoc />
 15public sealed class BinaryPrefixDivisibleByFivePrefixModulo : IBinaryPrefixDivisibleByFive
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="nums"></param>
 22    /// <returns></returns>
 23    public IList<bool> PrefixesDivBy5(int[] nums)
 224    {
 225        var result = new bool[nums.Length];
 26
 227        var prefix = 0;
 28
 1629        for (var i = 0; i < nums.Length; i++)
 630        {
 631            prefix = ((prefix << 1) + nums[i]) % 5;
 32
 633            result[i] = prefix == 0;
 634        }
 35
 236        return result;
 237    }
 38}

Methods/Properties

PrefixesDivBy5(System.Int32[])