Https://ide.codingblocks.com/s/183066 3 test cases getting failed

#1

https://ide.codingblocks.com/s/183066 is the solution for maximum xor subarray problem.plz tell me the error in the code

#2

https://hack.codingblocks.com/app/contests/718/p/1568

The code you have made is for the other question Max Xor Pair Implementation
For the given question we cant check for subsequence
We got to give answer for Subarray
Here is the correct code

#3

where is trie implementation in your code

#4

Just a small mistake the xor array u are making is wrongly initiialised
for(int i=0;i<n;i++){
if(i==0){
b[i]=a[i];
}else{
b[i]=a[i]^b[i-1];
}
}

u were doing b[i] = a[i] ^ a[i-1]

instead b[i] = b[i-1] ^ a[i] needs to be done

#5

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.