< Summary

Information
Class: LeetCode.Algorithms.SumOfSquareNumbers.SumOfSquareNumbersTwoPointers
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\SumOfSquareNumbers\SumOfSquareNumbersTwoPointers.cs
Line coverage
100%
Covered lines: 19
Uncovered lines: 0
Coverable lines: 19
Total lines: 49
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

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
JudgeSquareSum(...)100%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\SumOfSquareNumbers\SumOfSquareNumbersTwoPointers.cs

#LineLine 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
 12namespace LeetCode.Algorithms.SumOfSquareNumbers;
 13
 14/// <inheritdoc />
 15public class SumOfSquareNumbersTwoPointers : ISumOfSquareNumbers
 16{
 17    /// <summary>
 18    ///     Time complexity - O(Sqrt(c))
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="c"></param>
 22    /// <returns></returns>
 23    public bool JudgeSquareSum(int c)
 1124    {
 1125        long left = 0;
 1126        var right = (long)Math.Sqrt(c);
 27
 762328        while (left <= right)
 762029        {
 762030            var root = (left * left) + (right * right);
 31
 762032            if (root == c)
 833            {
 834                return true;
 35            }
 36
 761237            if (root > c)
 54238            {
 54239                right--;
 54240            }
 41            else
 707042            {
 707043                left++;
 707044            }
 761245        }
 46
 347        return false;
 1148    }
 49}

Methods/Properties

JudgeSquareSum(System.Int32)