[Solution] The Subarray XOR CodeChef Solution

[Solution] The Subarray XOR CodeChef Solution

Given an array A$A$ having N$N$ elements, a subarray S$S$ of A$A$ is called good if XOR(S)≥K$XOR(S)\ge K$, where XOR(S)$XOR(S)$ denotes the bitwise XOR of all the elements of the subarray S$S$.
Find the length of the smallest subarray S$S$ which is good. If there is no good subarray, print −1$-1$ instead.

Input Format

• The first line of input contains a single integer T$T$, denoting the number of test cases. The description of the T$T$ test cases follows.
• The first line of each test case contains two space-separated integers N$N$ and K$K$ - as described in the problem statement.

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

• The second line of each test case contains N$N$ space-separated integers A1,A2,...,AN$A_1,A_2,...,A_N$, Ai$A_i$ representing the elements of the array A$A$.

Output Format

For each test case, output in a single line, the length of the shortest subarray which is good. If there

Fitness CodeChef Solution

Complementary Strand in a DNA CodeChef Solution 

Make all equal using Pairs Codechef Solution

Count the ACs CodeChef Solution 

Strong Elements CodeChef Solution

Reversal Sorting CodeChef Solution

AP Grid CodeChef Solution

Gcd and Lcm CodeChef Solution

The Subarray XOR CodeChef Solution

 is no good subarray, print −1$-1$.

Constraints

• 1≤T≤2⋅104$1\le T\le 2\cdot {10}^4$
• 1≤N≤105$1\le N\le {10}^5$
• 0≤Ai<230$0\le A_i<2^{30}$
• 0≤K<231$0\le K<2^{31}$
• Sum of N$N$ over all test cases does not exceed 2⋅105$2\cdot {10}^5$.