Given two strings str1 and str2 of equal length, determine whether it is possible to transform str1 into str2 using zero or more conversion operations.

In a single operation, you can choose any character and simultaneously convert every occurrence of that character in str1 to another lowercase English letter.

Return true if str1 can be transformed into str2, or false otherwise.

Constraints:

• $1 \leq$ str1.length $=$ str2.length $\leq 10^4$

• str1 and str2 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.