| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2026 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.LongestPalindromeByConcatenatingTwoLetterWords; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public sealed class LongestPalindromeByConcatenatingTwoLetterWordsFrequencyDictionary : |
| | | 16 | | ILongestPalindromeByConcatenatingTwoLetterWords |
| | | 17 | | { |
| | | 18 | | /// <summary> |
| | | 19 | | /// Time complexity - O(n) |
| | | 20 | | /// Space complexity - O(n) |
| | | 21 | | /// </summary> |
| | | 22 | | /// <param name="words"></param> |
| | | 23 | | /// <returns></returns> |
| | | 24 | | public int LongestPalindrome(string[] words) |
| | 3 | 25 | | { |
| | 3 | 26 | | var longestPalindrome = 0; |
| | | 27 | | |
| | 3 | 28 | | var frequencyDictionary = new Dictionary<string, int>(); |
| | | 29 | | |
| | 33 | 30 | | foreach (var word in words) |
| | 12 | 31 | | { |
| | 12 | 32 | | var reversedWord = new string([word[1], word[0]]); |
| | | 33 | | |
| | 12 | 34 | | if (frequencyDictionary.TryGetValue(reversedWord, out var count) && count > 0) |
| | 3 | 35 | | { |
| | 3 | 36 | | longestPalindrome += 4; |
| | | 37 | | |
| | 3 | 38 | | frequencyDictionary[reversedWord] = count - 1; |
| | 3 | 39 | | } |
| | | 40 | | else |
| | 9 | 41 | | { |
| | 9 | 42 | | if (!frequencyDictionary.TryAdd(word, 1)) |
| | 1 | 43 | | { |
| | 1 | 44 | | frequencyDictionary[word]++; |
| | 1 | 45 | | } |
| | 9 | 46 | | } |
| | 12 | 47 | | } |
| | | 48 | | |
| | 9 | 49 | | if (frequencyDictionary.Any(frequency => frequency.Value > 0 && frequency.Key[0] == frequency.Key[1])) |
| | 2 | 50 | | { |
| | 2 | 51 | | return longestPalindrome + 2; |
| | | 52 | | } |
| | | 53 | | |
| | 1 | 54 | | return longestPalindrome; |
| | 3 | 55 | | } |
| | | 56 | | } |