< Summary

Information
Class: LeetCode.Algorithms.MergeStringsAlternately.MergeStringsAlternatelyTwoPointers
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MergeStringsAlternately\MergeStringsAlternatelyTwoPointers.cs
Line coverage
100%
Covered lines: 19
Uncovered lines: 0
Coverable lines: 19
Total lines: 52
Line coverage: 100%
Branch coverage
100%
Covered branches: 8
Total branches: 8
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
MergeAlternately(...)100%88100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MergeStringsAlternately\MergeStringsAlternatelyTwoPointers.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.MergeStringsAlternately;
 15
 16/// <inheritdoc />
 17public class MergeStringsAlternatelyTwoPointers : IMergeStringsAlternately
 18{
 19    /// <summary>
 20    ///     Time complexity - O(m + n)
 21    ///     Space complexity - O(1)
 22    /// </summary>
 23    /// <param name="word1"></param>
 24    /// <param name="word2"></param>
 25    /// <returns></returns>
 26    public string MergeAlternately(string word1, string word2)
 327    {
 328        var word1Index = 0;
 329        var word2Index = 0;
 30
 331        var resultStringBuilder = new StringBuilder();
 32
 1433        while (word1Index < word1.Length || word2Index < word2.Length)
 1134        {
 1135            if (word1Index < word1.Length)
 936            {
 937                resultStringBuilder.Append(word1[word1Index]);
 38
 939                word1Index++;
 940            }
 41
 1142            if (word2Index < word2.Length)
 943            {
 944                resultStringBuilder.Append(word2[word2Index]);
 45
 946                word2Index++;
 947            }
 1148        }
 49
 350        return resultStringBuilder.ToString();
 351    }
 52}