You are given two strings s1 and s2, both of length n, consisting of lowercase English letters.

You can apply the following operation on any of the two strings any number of times:

Choose any two indices i and j such that i $<$ j and the difference j $-$ i is even, then swap the characters at these indices in the chosen string.

Return true if you can make the strings s1 and s2 equal, and false otherwise.

Constraints:

• n $=$ s1.length $=$ s2.length

• $1 \leq$ n $\leq 10^5$

• s1 and s2 consist only of 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.