< Summary

Information
Class: LeetCode.Algorithms.UniqueLength3PalindromicSubsequences.UniqueLength3PalindromicSubsequencesBruteForce
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\UniqueLength3PalindromicSubsequences\UniqueLength3PalindromicSubsequencesBruteForce.cs
Line coverage
100%
Covered lines: 22
Uncovered lines: 0
Coverable lines: 22
Total lines: 55
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
CountPalindromicSubsequence(...)100%88100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\UniqueLength3PalindromicSubsequences\UniqueLength3PalindromicSubsequencesBruteForce.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.UniqueLength3PalindromicSubsequences;
 15
 16/// <inheritdoc />
 17public class UniqueLength3PalindromicSubsequencesBruteForce : IUniqueLength3PalindromicSubsequences
 18{
 19    /// <summary>
 20    ///     Time complexity - O(n^3)
 21    ///     Space complexity - O(n)
 22    /// </summary>
 23    /// <param name="s"></param>
 24    /// <returns></returns>
 25    public int CountPalindromicSubsequence(string s)
 326    {
 327        var palindromesHashSet = new HashSet<string>();
 28
 2429        for (var i = 2; i < s.Length; i++)
 930        {
 6231            for (var j = 0; j <= i - 2; j++)
 2232            {
 2233                if (s[j] != s[i])
 1434                {
 1435                    continue;
 36                }
 37
 5038                for (var k = j + 1; k < i; k++)
 1739                {
 1740                    var palindromeStringBuilder = new StringBuilder();
 41
 1742                    palindromeStringBuilder.Append(s[i]);
 1743                    palindromeStringBuilder.Append(s[k]);
 1744                    palindromeStringBuilder.Append(s[j]);
 45
 1746                    var palindrome = palindromeStringBuilder.ToString();
 47
 1748                    palindromesHashSet.Add(palindrome);
 1749                }
 850            }
 951        }
 52
 353        return palindromesHashSet.Count;
 354    }
 55}