B for Bitwise

CodeChefOpen on judge ↗

You are given an array **A** of **N** integers. Your task is to find out if there exist four distinct indices $i$, $j$, $k$ and $l$ such that **A[i] ^ A[j] ^ A[k] ^ A[l] = 0**. (Here ^ denotes the bitwise xor operation) where **(0 <= i, j, k, l < n and i != j != k != l)**. If there exist four such indices then print "**YES**" (without quotes) otherwise "**NO**" (without quotes). ### Input: -

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