| | | 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.FindCommonCharacters; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class FindCommonCharactersDictionary : IFindCommonCharacters |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n * m), where n is the number of words and m is the maximum length of the words |
| | | 19 | | /// Space complexity - O(m), m is the maximum length of the words |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="words"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public IList<string> CommonChars(string[] words) |
| | 9 | 24 | | { |
| | 9 | 25 | | var commonChars = words[0].ToList(); |
| | | 26 | | |
| | 65 | 27 | | foreach (var word in words.Skip(1)) |
| | 19 | 28 | | { |
| | 19 | 29 | | var wordDictionary = new Dictionary<char, int>(); |
| | | 30 | | |
| | 214 | 31 | | foreach (var c in word.Where(c => !wordDictionary.TryAdd(c, 1))) |
| | 34 | 32 | | { |
| | 34 | 33 | | wordDictionary[c]++; |
| | 34 | 34 | | } |
| | | 35 | | |
| | 19 | 36 | | var charsToRemove = new List<char>(); |
| | | 37 | | |
| | 155 | 38 | | foreach (var c in commonChars) |
| | 49 | 39 | | { |
| | 49 | 40 | | if (wordDictionary.TryGetValue(c, out var count) && count > 0) |
| | 35 | 41 | | { |
| | 35 | 42 | | wordDictionary[c]--; |
| | 35 | 43 | | } |
| | | 44 | | else |
| | 14 | 45 | | { |
| | 14 | 46 | | charsToRemove.Add(c); |
| | 14 | 47 | | } |
| | 49 | 48 | | } |
| | | 49 | | |
| | 85 | 50 | | foreach (var charToRemove in charsToRemove) |
| | 14 | 51 | | { |
| | 14 | 52 | | commonChars.Remove(charToRemove); |
| | 14 | 53 | | } |
| | 19 | 54 | | } |
| | | 55 | | |
| | 25 | 56 | | return commonChars.Select(c => c.ToString()).ToList(); |
| | 9 | 57 | | } |
| | | 58 | | } |