You are given an array of strings words.

In one operation, you may choose four indices i, j, x, and y such that $0 \leq$ i, j $<$ words.length, $0 \leq$ x $<$ words[i].length, and $0 \leq$ y $<$ words[j].length, and swap the characters words[i][x] and words[j][y].

You are allowed to apply this operation any number of times.

Return the maximum number of palindromic strings that words can contain after performing any number of operations.

Note: A string is a palindrome if it reads the same forward and backward.

Constraints:

• $1 \leq$ words.length $\leq 1000$

• $1 \leq$ words[i].length $\leq 100$

• words[i] consists only of lowercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.