< Summary

Information

Class:	LeetCode.Algorithms.MaximumSubstringsWithDistinctStart.MaximumSubstringsWithDistinctStartBase
Assembly:	LeetCode
File(s):	D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MaximumSubstringsWithDistinctStart\MaximumSubstringsWithDistinctStartBase.cs

Line coverage

100%

Branch coverage

N/A

Method coverage

Feature is only available for sponsors

Metrics

Method	Branch coverage	Crap Score	Cyclomatic complexity	Line coverage
GetIndex(...)	100%	1	1	100%

#	Line	Line 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`
	`12`	`namespace LeetCode.Algorithms.MaximumSubstringsWithDistinctStart;`
	`13`
	`14`	`/// <inheritdoc />`
	`15`	`public abstract class MaximumSubstringsWithDistinctStartBase : IMaximumSubstringsWithDistinctStart`
	`16`	`{`
	`17`	`protected const byte AlphabetLength = 'z' - 'a' + 1;`
	`18`
	`19`	`public abstract int MaxDistinct(string s);`
	`20`
	`21`	`protected static int GetIndex(char c)`
36	`22`	`{`
36	`23`	`return c - 'a';`
36	`24`	`}`
	`25`	`}`