< Summary

Information
Class: LeetCode.Algorithms.ReverseString2.ReverseString2WithCharArray
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\ReverseString2\ReverseString2WithCharArray.cs
Line coverage
100%
Covered lines: 15
Uncovered lines: 0
Coverable lines: 15
Total lines: 44
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
ReverseStr(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\ReverseString2\ReverseString2WithCharArray.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.ReverseString2;
 13
 14/// <inheritdoc />
 15public class ReverseString2WithCharArray : IReverseString2
 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 ReverseStr(string s, int k)
 225    {
 226        var charArray = s.ToCharArray();
 27
 1028        for (var start = 0; start < charArray.Length; start += 2 * k)
 329        {
 330            var i = start;
 331            var j = Math.Min(start + k - 1, charArray.Length - 1);
 32
 633            while (i < j)
 334            {
 335                (charArray[i], charArray[j]) = (charArray[j], charArray[i]);
 36
 337                i++;
 338                j--;
 339            }
 340        }
 41
 242        return new string(charArray);
 243    }
 44}