| | | 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.FindWordsContainingCharacter; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class FindWordsContainingCharacterDictionary : IFindWordsContainingCharacter |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n * k), where n is the number of words in the words array, and k is the average number o |
| | | 19 | | /// unique characters per word |
| | | 20 | | /// Space complexity - O(n * k), where n is the number of words in the words array, and k is the average number |
| | | 21 | | /// unique characters per word |
| | | 22 | | /// </summary> |
| | | 23 | | /// <param name="words"></param> |
| | | 24 | | /// <param name="x"></param> |
| | | 25 | | /// <returns></returns> |
| | | 26 | | public IList<int> FindWordsContaining(string[] words, char x) |
| | 3 | 27 | | { |
| | 3 | 28 | | var charToWordIndexDictionary = new Dictionary<char, List<int>>(); |
| | | 29 | | |
| | 26 | 30 | | for (var i = 0; i < words.Length; i++) |
| | 10 | 31 | | { |
| | 10 | 32 | | var uniqueChars = new HashSet<char>(words[i]); |
| | | 33 | | |
| | 80 | 34 | | foreach (var ch in uniqueChars) |
| | 25 | 35 | | { |
| | 25 | 36 | | if (!charToWordIndexDictionary.TryGetValue(ch, out var value)) |
| | 14 | 37 | | { |
| | 14 | 38 | | value = []; |
| | 14 | 39 | | charToWordIndexDictionary[ch] = value; |
| | 14 | 40 | | } |
| | | 41 | | |
| | 25 | 42 | | value.Add(i); |
| | 25 | 43 | | } |
| | 10 | 44 | | } |
| | | 45 | | |
| | 3 | 46 | | return charToWordIndexDictionary.TryGetValue(x, out var indices) ? indices : []; |
| | 3 | 47 | | } |
| | | 48 | | } |