java.lang.Object
g2101_2200.s2131_longest_palindrome_by_concatenating_two_letter_words.Solution

public class Solution extends java.lang.Object
2131 - Longest Palindrome by Concatenating Two Letter Words.

Medium

You are given an array of strings words. Each element of words consists of two lowercase English letters.

Create the longest possible palindrome by selecting some elements from words and concatenating them in any order. Each element can be selected at most once.

Return the length of the longest palindrome that you can create. If it is impossible to create any palindrome, return 0.

A palindrome is a string that reads the same forward and backward.

Example 1:

Input: words = [“lc”,“cl”,“gg”]

Output: 6

Explanation: One longest palindrome is “lc” + “gg” + “cl” = “lcggcl”, of length 6. Note that “clgglc” is another longest palindrome that can be created.

Example 2:

Input: words = [“ab”,“ty”,“yt”,“lc”,“cl”,“ab”]

Output: 8

Explanation: One longest palindrome is “ty” + “lc” + “cl” + “yt” = “tylcclyt”, of length 8. Note that “lcyttycl” is another longest palindrome that can be created.

Example 3:

Input: words = [“cc”,“ll”,“xx”]

Output: 2

Explanation: One longest palindrome is “cc”, of length 2. Note that “ll” is another longest palindrome that can be created, and so is “xx”.

Constraints:

  • 1 <= words.length <= 105
  • words[i].length == 2
  • words[i] consists of lowercase English letters.
  • Constructor Summary

    Constructors
    Constructor
    Description
     
  • Method Summary

    Modifier and Type
    Method
    Description
    int
    longestPalindrome(java.lang.String[] words)
     

    Methods inherited from class java.lang.Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
  • Constructor Details

    • Solution

      public Solution()
  • Method Details

    • longestPalindrome

      public int longestPalindrome(java.lang.String[] words)