< Summary

Information

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

Line coverage

89%

Covered lines:	17
Uncovered lines:	2
Coverable lines:	19
Total lines:	49
Line coverage:	89.4%

Branch coverage

83%

Covered branches:	5
Total branches:	6
Branch coverage:	83.3%

Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

Method	Branch coverage	Crap Score	Cyclomatic complexity	Line coverage
FindDuplicate(...)	83.33%	6	6	89.47%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FindTheDuplicateNumber\FindTheDuplicateNumberFloydTortoiseAndHareAlgorithm.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.FindTheDuplicateNumber;`
	`13`
	`14`	`/// <inheritdoc />`
	`15`	`public class FindTheDuplicateNumberFloydTortoiseAndHareAlgorithm : IFindTheDuplicateNumber`
	`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 int FindDuplicate(int[] nums)`
3	`24`	`{`
3	`25`	`if (nums.Length <= 1)`
0	`26`	`{`
0	`27`	`return -1;`
	`28`	`}`
	`29`
3	`30`	`var slow = nums[0];`
3	`31`	`var fast = nums[slow];`
	`32`
8	`33`	`while (slow != fast)`
5	`34`	`{`
5	`35`	`slow = nums[slow];`
5	`36`	`fast = nums[nums[fast]];`
5	`37`	`}`
	`38`
3	`39`	`fast = 0;`
	`40`
8	`41`	`while (slow != fast)`
5	`42`	`{`
5	`43`	`slow = nums[slow];`
5	`44`	`fast = nums[fast];`
5	`45`	`}`
	`46`
3	`47`	`return slow;`
3	`48`	`}`
	`49`	`}`

< Summary

Metrics

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FindTheDuplicateNumber\FindTheDuplicateNumberFloydTortoiseAndHareAlgorithm.cs

Methods/Properties