Maximum Xor Sum
You are given arrays $A$ and $B$ with $N$ non-negative integers each. An array $X$ of length $N$ is called *good*, if: - All elements of the array $X$ are non-negative; - $X_1$ $|$ $X_2$ $|$ $\ldots$ $|$ $X_i = A_i$ for all $(1\le i\le N)$; - $X_i$ $\&$ $X_{(i+1)}$ $\&$ $\ldots$ $\&$ $X_N = B_i$ for all $(1\le i\le N)$. Find the **maximum** bitwise XOR of all elements over all good arrays $X$.
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.
Sign in to chat with the tutor and save your progress.
Sign in to start