Array Xor

CodeChefOpen on judge ↗

Problem Statement You are provided with an array of N integers, you have to add a single integer X to the array such that the XOR of all the element of the array including X becomes equal to K. INPUT First line will contain T the number of test cases. First line of each test case will contain two numbers N and K. Second line of each test case will contain N integers. OUTPUT Output a single

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