< Summary

Information
Class: LeetCode.Algorithms.ConstructKPalindromeStrings.ConstructKPalindromeStringsFrequencyDictionary
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\ConstructKPalindromeStrings\ConstructKPalindromeStringsFrequencyDictionary.cs
Line coverage
81%
Covered lines: 9
Uncovered lines: 2
Coverable lines: 11
Total lines: 40
Line coverage: 81.8%
Branch coverage
83%
Covered branches: 5
Total branches: 6
Branch coverage: 83.3%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
CanConstruct(...)83.33%6681.81%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\ConstructKPalindromeStrings\ConstructKPalindromeStringsFrequencyDictionary.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.ConstructKPalindromeStrings;
 13
 14/// <inheritdoc />
 15public class ConstructKPalindromeStringsFrequencyDictionary : IConstructKPalindromeStrings
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(n)
 20    /// </summary>
 21    /// <param name="s"></param>
 22    /// <param name="k"></param>
 23    /// <returns></returns>
 24    public bool CanConstruct(string s, int k)
 325    {
 326        if (s.Length < k)
 027        {
 028            return false;
 29        }
 30
 331        var frequencyDictionary = new Dictionary<char, int>();
 32
 4233        foreach (var c in s.Where(c => !frequencyDictionary.TryAdd(c, 1)))
 634        {
 635            frequencyDictionary[c]++;
 636        }
 37
 1838        return frequencyDictionary.Count(frequency => frequency.Value % 2 == 1) <= k;
 339    }
 40}