< Summary

Information

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

Line coverage

81%

Branch coverage

75%

Method coverage

Feature is only available for sponsors

Metrics

Method	Branch coverage	Crap Score	Cyclomatic complexity	Line coverage
SmallestNumber(...)	75%	4	4	81.81%

#	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.SmallestNumberWithAllSetBits;`
	`13`
	`14`	`/// <inheritdoc />`
	`15`	`public sealed class SmallestNumberWithAllSetBitsIterative : ISmallestNumberWithAllSetBits`
	`16`	`{`
	`17`	`/// <summary>`
	`18`	`/// Time complexity - O(n)`
	`19`	`/// Space complexity - O(1)`
	`20`	`/// </summary>`
	`21`	`/// <param name="n"></param>`
	`22`	`/// <returns></returns>`
	`23`	`public int SmallestNumber(int n)`
3	`24`	`{`
3	`25`	`if (n == 1)`
0	`26`	`{`
0	`27`	`return 1;`
	`28`	`}`
	`29`
3	`30`	`var x = 3;`
	`31`
6	`32`	`while (x < n)`
3	`33`	`{`
3	`34`	`x = (x * 2) + 1;`
3	`35`	`}`
	`36`
3	`37`	`return x;`
3	`38`	`}`
	`39`	`}`