< Summary

Information
Class: LeetCode.Algorithms.ReversePrefixOfWord.ReversePrefixOfWordStringBuilder
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\ReversePrefixOfWord\ReversePrefixOfWordStringBuilder.cs
Line coverage
100%
Covered lines: 16
Uncovered lines: 0
Coverable lines: 16
Total lines: 49
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
ReversePrefix(...)100%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\ReversePrefixOfWord\ReversePrefixOfWordStringBuilder.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.ReversePrefixOfWord;
 15
 16/// <inheritdoc />
 17public class ReversePrefixOfWordStringBuilder : IReversePrefixOfWord
 18{
 19    /// <summary>
 20    ///     Time complexity - O(n)
 21    ///     Space complexity - O(n)
 22    /// </summary>
 23    /// <param name="word"></param>
 24    /// <param name="ch"></param>
 25    /// <returns></returns>
 26    public string ReversePrefix(string word, char ch)
 327    {
 328        var chIndex = word.IndexOf(ch);
 29
 330        if (chIndex < 0)
 131        {
 132            return word;
 33        }
 34
 235        var result = new StringBuilder();
 36
 2037        for (var i = chIndex; i >= 0; i--)
 838        {
 839            result.Append(word[i]);
 840        }
 41
 1442        for (var i = chIndex + 1; i < word.Length; i++)
 543        {
 544            result.Append(word[i]);
 545        }
 46
 247        return result.ToString();
 348    }
 49}