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.

Input: word1 = "a"-str, word2 = "b"-str
Output: true-bool
Explanation: Swapping the only characters produces "b" and "a", which each contain one distinct character.

Input: word1 = "aa"-str, word2 = "bbb"-str
Output: true-bool
Explanation: Swapping an a from word1 with a b from word2 produces "ba" and "abb", which each contain two distinct characters.

Input: word1 = "aabbc"-str, word2 = "dde"-str
Output: true-bool
Explanation: Swapping c from word1 with d from word2 produces strings with three distinct characters each.

Input: word1 = "aabb"-str, word2 = "ccdd"-str
Output: true-bool
Explanation: Swapping a from word1 with c from word2 produces "cabb" and "acdd", which each contain three distinct characters.

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.