Maximise XOR

CodeChefOpen on judge ↗

Chef has two binary strings A and B, each of length N. Chef can rearrange both the strings in any way. Find the maximum bitwise XOR he can achieve if he rearranges the strings optimally. ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - Each test case consists of two lines of input. - The first line of each test case contains binary st

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI