< Summary

Information
Class: LeetCode.Algorithms.ReverseVowelsOfString.ReverseVowelsOfStringTwoPointers
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\ReverseVowelsOfString\ReverseVowelsOfStringTwoPointers.cs
Line coverage
100%
Covered lines: 33
Uncovered lines: 0
Coverable lines: 33
Total lines: 68
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
.ctor()100%11100%
ReverseVowels(...)100%66100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\ReverseVowelsOfString\ReverseVowelsOfStringTwoPointers.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.ReverseVowelsOfString;
 13
 14/// <inheritdoc />
 15public class ReverseVowelsOfStringTwoPointers : IReverseVowelsOfString
 16{
 417    private readonly HashSet<char> _vowelsHashSet =
 418    [
 419        'a',
 420        'e',
 421        'i',
 422        'o',
 423        'u',
 424        'A',
 425        'E',
 426        'I',
 427        'O',
 428        'U'
 429    ];
 30
 31    /// <summary>
 32    ///     Time complexity - O(n)
 33    ///     Space complexity - O(n)
 34    /// </summary>
 35    /// <param name="s"></param>
 36    /// <returns></returns>
 37    public string ReverseVowels(string s)
 438    {
 439        var sArray = s.ToCharArray();
 40
 441        var left = 0;
 442        var right = s.Length - 1;
 43
 3344        while (left < right)
 2945        {
 2946            if (!_vowelsHashSet.Contains(s[left]))
 1147            {
 1148                left++;
 49
 1150                continue;
 51            }
 52
 1853            if (!_vowelsHashSet.Contains(s[right]))
 1054            {
 1055                right--;
 56
 1057                continue;
 58            }
 59
 860            (sArray[left], sArray[right]) = (sArray[right], sArray[left]);
 61
 862            left++;
 863            right--;
 864        }
 65
 466        return new string(sArray);
 467    }
 68}