< Summary

Information
Class: LeetCode.Algorithms.ReverseStringPrefix.ReverseStringPrefixTwoPointers
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\ReverseStringPrefix\ReverseStringPrefixTwoPointers.cs
Line coverage
100%
Covered lines: 11
Uncovered lines: 0
Coverable lines: 11
Total lines: 40
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
ReversePrefix(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\ReverseStringPrefix\ReverseStringPrefixTwoPointers.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.ReverseStringPrefix;
 13
 14/// <inheritdoc />
 15public sealed class ReverseStringPrefixTwoPointers : IReverseStringPrefix
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(n)
 20    /// </summary>
 21    /// <param name="s"></param>
 22    /// <param name="k"></param>
 23    /// <returns></returns>
 24    public string ReversePrefix(string s, int k)
 325    {
 326        if (k == 1)
 127        {
 128            return s;
 29        }
 30
 231        var sCharArray = s.ToCharArray();
 32
 833        for (var i = 0; i < k / 2; i++)
 234        {
 235            (sCharArray[i], sCharArray[k - i - 1]) = (sCharArray[k - i - 1], sCharArray[i]);
 236        }
 37
 238        return new string(sCharArray);
 339    }
 40}