You are given two $0$ indexed strings, word1 and word2.

A move consists of selecting two indices, $i$ and $j$, such that $0 \leq i <$ word1.length and $0 \leq j <$ word2.length, and swapping the character word1[i] with the character word2[j].

Return true if it is possible to make the number of distinct characters in word1 and word2 equal after applying exactly one move, and false otherwise.

Constraints:

• $1 \leq$ word1.length, word2.length $\leq 10^5$

• word1 and word2 consist of 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.