| | 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 | |
|
| | 12 | | namespace LeetCode.Algorithms.MaximumNumberOfWordsYouCanType; |
| | 13 | |
|
| | 14 | | /// <inheritdoc /> |
| | 15 | | public 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) |
| 3 | 25 | | { |
| 3 | 26 | | var brokenLettersHashSet = new HashSet<char>(brokenLetters); |
| 3 | 27 | | var words = text.Split(' '); |
| 3 | 28 | | var count = words.Length; |
| | 29 | |
|
| 21 | 30 | | foreach (var word in words) |
| 6 | 31 | | { |
| 6 | 32 | | if (word.Any(brokenLettersHashSet.Contains)) |
| 4 | 33 | | { |
| 4 | 34 | | count--; |
| 4 | 35 | | } |
| 6 | 36 | | } |
| | 37 | |
|
| 3 | 38 | | return count; |
| 3 | 39 | | } |
| | 40 | | } |