Can u have a look at my code?

#1

please rectify the error as 1 test case if not passing

#2

@kodivine0
Please send the code. Also copy the code in a CB ide and then send the link.

#3

https://ide.codingblocks.com/s/334535 here u go

#4

@kodivine0
You are supposed to find the maximum xor of a subarray. You thus first need to process the array. Create a separate array xors where xors[i] = xors[ i -1] ^ arr[i]. This array stores the cumulative xors. And then you apply the algorithm you are trying to apply. Please refer to Prateek Sir’s video in the course content. You will attain a better understanding.

Please revert in case you face any query.

#5

please go through my code. i have implemented it in the same way as taught by pratik sir.

#6

@kodivine0
You have not taken the cumulative xors. Just perform that step and your algo should work just fine. Also, compare your maxxor value with a[i] also because 0 to i is also a valid subarray.

If you face any difficulty, please feel free to revert