Two strings are considered close if one can be transformed into the other by applying any sequence of the following operations:

• Operation $1$: Swap any two existing characters. For instance, abcde becomes aebcd.

• Operation $2$: Swap the frequencies of any two existing characters by transforming every occurrence of one existing character into another existing character, and vice versa. For instance, aacabb becomes bbcbaa by transforming all a characters to b and all b characters to a.

You may apply these operations on either string as many times as needed.

Given two strings, word1 and word2, return true if word1 and word2 are close, and false otherwise.

Constraints:

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

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