Longest Palindrome by Concatenating Two Letter Words
You receive 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 .
Produce the length of the longest palindrome that you can create . If it is impossible to create any palindrome, return 0 .
A palindrome is a text that reads the same forward and backward.
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.
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.
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 <= 10^5words[i].length == 2words[i]consists of lowercase English letters.
Did this problem appear in one of your interviews?
Responses stay private.