You are given two binary strings s and t of equal length.

You can rearrange the characters of t in any order.

Return a binary string representing the maximum possible bitwise XOR result between s and any rearrangement of t.

Constraints:

• $1 \leq n ==$ s.length $==$ t.length $\leq 2 \times 10^5$

• s[i] and t[i] are either '0' or '1'.

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.