any operation. There is one palindrome in words "a". It can be shown that it is not possible to get more than one palindrome after any number of operations. Hence, the answer is 1.

Constraints

1 <= words.length <= 1000
1 <= words[i].length <= 100
words[i] consists only of lowercase English letters.

Solution

Method 1 – Greedy Counting and Pairing

Intuition

Since we can swap any characters between any words, the total multiset of all characters is fixed. To maximize the number of palindromes, we want to distribute the characters so that as many words as possible can be rearranged into palindromes. A word can be rearranged

Related Tags