< Summary

Information
Class: LeetCode.Algorithms.FirstMatchingCharacterFromBothEnds.FirstMatchingCharacterFromBothEndsIterative
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FirstMatchingCharacterFromBothEnds\FirstMatchingCharacterFromBothEndsIterative.cs
Line coverage
100%
Covered lines: 10
Uncovered lines: 0
Coverable lines: 10
Total lines: 37
Line coverage: 100%
Branch coverage
100%
Covered branches: 4
Total branches: 4
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
FirstMatchingIndex(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FirstMatchingCharacterFromBothEnds\FirstMatchingCharacterFromBothEndsIterative.cs

#LineLine 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
 12namespace LeetCode.Algorithms.FirstMatchingCharacterFromBothEnds;
 13
 14/// <inheritdoc />
 15public sealed class FirstMatchingCharacterFromBothEndsIterative : IFirstMatchingCharacterFromBothEnds
 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 FirstMatchingIndex(string s)
 324    {
 325        var n = s.Length;
 26
 2227        for (var i = 0; i < n; i++)
 1028        {
 1029            if (s[i] == s[n - i - 1])
 230            {
 231                return i;
 32            }
 833        }
 34
 135        return -1;
 336    }
 37}