< Summary

Information
Class: LeetCode.Algorithms.ValidPalindrome.ValidPalindromeTwoPointers
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\ValidPalindrome\ValidPalindromeTwoPointers.cs
Line coverage
100%
Covered lines: 21
Uncovered lines: 0
Coverable lines: 21
Total lines: 51
Line coverage: 100%
Branch coverage
100%
Covered branches: 12
Total branches: 12
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
IsPalindrome(...)100%1212100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\ValidPalindrome\ValidPalindromeTwoPointers.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.ValidPalindrome;
 13
 14/// <inheritdoc />
 15public class ValidPalindromeTwoPointers : IValidPalindrome
 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 bool IsPalindrome(string s)
 524    {
 525        var left = 0;
 526        var right = s.Length - 1;
 27
 2028        while (left < right)
 1729        {
 2530            while (left < right && !char.IsAsciiLetterOrDigit(s[left]))
 831            {
 832                left++;
 833            }
 34
 2035            while (left < right && !char.IsAsciiLetterOrDigit(s[right]))
 336            {
 337                right--;
 338            }
 39
 1740            if (char.ToLower(s[left]) != char.ToLower(s[right]))
 241            {
 242                return false;
 43            }
 44
 1545            left++;
 1546            right--;
 1547        }
 48
 349        return true;
 550    }
 51}

Methods/Properties

IsPalindrome(System.String)