< Summary

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

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\ReverseString2\ReverseString2WithStringBuilder.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
 12using System.Text;
 13
 14namespace LeetCode.Algorithms.ReverseString2;
 15
 16/// <inheritdoc />
 17public class ReverseString2WithStringBuilder : IReverseString2
 18{
 19    /// <summary>
 20    ///     Time complexity - O(n)
 21    ///     Space complexity - O(n)
 22    /// </summary>
 23    /// <param name="s"></param>
 24    /// <param name="k"></param>
 25    /// <returns></returns>
 26    public string ReverseStr(string s, int k)
 227    {
 228        var reverseStringBuilder = new StringBuilder();
 29
 230        var reverse = true;
 231        var sIndex = 0;
 32
 833        while (sIndex < s.Length)
 634        {
 35            IEnumerable<char> charArray;
 36
 637            if (reverse)
 338            {
 339                charArray = s.Skip(sIndex).Take(k).Reverse();
 40
 341                reverse = false;
 342            }
 43            else
 344            {
 345                charArray = s.Skip(sIndex).Take(k);
 46
 347                reverse = true;
 348            }
 49
 4050            foreach (var c in charArray)
 1151            {
 1152                reverseStringBuilder.Append(c);
 1153            }
 54
 655            sIndex += k;
 656        }
 57
 258        return reverseStringBuilder.ToString();
 259    }
 60}