< Summary

Information

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

Line coverage

100%

Covered lines:	23
Uncovered lines:	0
Coverable lines:	23
Total lines:	54
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

Method	Branch coverage	Crap Score	Cyclomatic complexity	Line coverage
MinAddToMakeValid(...)	100%	6	6	100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MinimumAddToMakeParenthesesValid\MinimumAddToMakeParenthesesValidIterative.cs

#	Line	Line 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`
	`12`	`namespace LeetCode.Algorithms.MinimumAddToMakeParenthesesValid;`
	`13`
	`14`	`/// <inheritdoc />`
	`15`	`public class MinimumAddToMakeParenthesesValidIterative : IMinimumAddToMakeParenthesesValid`
	`16`	`{`
	`17`	`/// <summary>`
	`18`	`/// Time complexity - O(n)`
	`19`	`/// Space complexity - O(1)`
	`20`	`/// </summary>`
	`21`	`/// <param name="s"></param>`
	`22`	`/// <returns></returns>`
	`23`	`public int MinAddToMakeValid(string s)`
2	`24`	`{`
2	`25`	`var minAdd = 0;`
	`26`
2	`27`	`var openCount = 0;`
	`28`
18	`29`	`foreach (var c in s)`
6	`30`	`{`
6	`31`	`if (c == '(')`
4	`32`	`{`
4	`33`	`openCount++;`
	`34`
4	`35`	`minAdd++;`
4	`36`	`}`
	`37`	`else`
2	`38`	`{`
2	`39`	`if (openCount > 0)`
1	`40`	`{`
1	`41`	`openCount--;`
	`42`
1	`43`	`minAdd--;`
1	`44`	`}`
	`45`	`else`
1	`46`	`{`
1	`47`	`minAdd++;`
1	`48`	`}`
2	`49`	`}`
6	`50`	`}`
	`51`
2	`52`	`return minAdd;`
2	`53`	`}`
	`54`	`}`

< Summary

Metrics

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MinimumAddToMakeParenthesesValid\MinimumAddToMakeParenthesesValidIterative.cs

Methods/Properties