MIN MAX XOR
CodeChefOpen on judge ↗
$John$ is a computer science student and he is currently working on a project for his class. His professor gave him three binary strings $A$, $B$, and $C$ each of length $N$ and asked him to find a new string V, by following these steps: - Find the minimum bitwise XOR between $A$ and $B$, which creates a new string $D$. - Using string $D$, find the maximum bitwise XOR between $D$ and $C$. The res
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