Minimum Xor

CodeChefOpen on judge ↗

You are given an array of size $N$ and element $K$. You have to find a sub array of size $K$ whose XOR of all elements is minimum possible. Print minimum XOR. ### Input - First line will contain $T$, number of testcases. Then the testcases follow. - First line of each test case contains two space seperated integer $N$ and $K$. - Second line will contain $N$ integers $A_1,A_2...A_N$. ### Output

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