< Summary

Information
Class: LeetCode.Algorithms.MaximumSubstringsWithDistinctStart.MaximumSubstringsWithDistinctStartBitArray
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MaximumSubstringsWithDistinctStart\MaximumSubstringsWithDistinctStartBitArray.cs
Line coverage
100%
Covered lines: 14
Uncovered lines: 0
Coverable lines: 14
Total lines: 47
Line coverage: 100%
Branch coverage
100%
Covered branches: 4
Total branches: 4
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
MaxDistinct(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MaximumSubstringsWithDistinctStart\MaximumSubstringsWithDistinctStartBitArray.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
 12using System.Collections;
 13
 14namespace LeetCode.Algorithms.MaximumSubstringsWithDistinctStart;
 15
 16/// <inheritdoc />
 17public sealed class MaximumSubstringsWithDistinctStartBitArray : MaximumSubstringsWithDistinctStartBase
 18{
 19    /// <summary>
 20    ///     Time complexity - O(n)
 21    ///     Space complexity - O(1)
 22    /// </summary>
 23    /// <param name="s"></param>
 24    /// <returns></returns>
 25    public override int MaxDistinct(string s)
 326    {
 327        var result = 0;
 28
 329        var charactersLookup = new BitArray(AlphabetLength);
 30
 3031        for (var i = 0; i < s.Length; i++)
 1232        {
 1233            var index = GetIndex(s[i]);
 34
 1235            if (charactersLookup[index])
 536            {
 537                continue;
 38            }
 39
 740            charactersLookup[index] = true;
 41
 742            result++;
 743        }
 44
 345        return result;
 346    }
 47}

Methods/Properties

MaxDistinct(System.String)