Another Easy XOR problem

CodeChefOpen on judge ↗

Avengers are in trouble. They will have to go back in time to save the earth. But the question what is the exact time they want to go back. Doctor strange says the answer to this question lies in the correct arrangement of array $B$. You are given 2 arrays $A$ and $B$ both containing $n$ elements each. You have to arrange array $B$ in such a way such that the sum of XOR of elements placed at

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