Given a $0$ indexed array words consisting of distinct strings.

The string words[i] can be paired with the string words[j] if:

• The string words[i] is equal to the reversed string of words[j].

• $0 \leq i < j <$ words.length.

Return the maximum number of pairs that can be formed from the array words.

Note: Each string can belong to at most one pair.

Constraints:

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

• words[i].length $= 2$

• words consists of distinct strings.

• words[i] contains only 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.