< Summary

Information
Class: LeetCode.Algorithms.MaximumNumberOfWordsYouCanType.MaximumNumberOfWordsYouCanTypeHashSet
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MaximumNumberOfWordsYouCanType\MaximumNumberOfWordsYouCanTypeHashSet.cs
Line coverage
100%
Covered lines: 13
Uncovered lines: 0
Coverable lines: 13
Total lines: 40
Line coverage: 100%
Branch coverage
100%
Covered branches: 4
Total branches: 4
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
CanBeTypedWords(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MaximumNumberOfWordsYouCanType\MaximumNumberOfWordsYouCanTypeHashSet.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.MaximumNumberOfWordsYouCanType;
 13
 14/// <inheritdoc />
 15public class MaximumNumberOfWordsYouCanTypeHashSet : IMaximumNumberOfWordsYouCanType
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n + m), where n is the length of the text and m is the length of brokenLetters
 19    ///     Space complexity - O(n + m), where n is the length of the text and m is the length of brokenLetters
 20    /// </summary>
 21    /// <param name="text"></param>
 22    /// <param name="brokenLetters"></param>
 23    /// <returns></returns>
 24    public int CanBeTypedWords(string text, string brokenLetters)
 325    {
 326        var brokenLettersHashSet = new HashSet<char>(brokenLetters);
 327        var words = text.Split(' ');
 328        var count = words.Length;
 29
 2130        foreach (var word in words)
 631        {
 632            if (word.Any(brokenLettersHashSet.Contains))
 433            {
 434                count--;
 435            }
 636        }
 37
 338        return count;
 339    }
 40}