Problem in short : Find sum of XOR of all subarrays of size>1 in the given array of size n in linear time.
My idea is to get the prefix sum array of XORs and now the problem is reduced to finding XOR between all possible pairs in prefix XOR array.
I tried for hours to debug the code but couldn't figure out what did I do wrong. Any help would be greatly appreciated.
Old Code
UPD :
AC
What was the problem earlier ?
Thanks srinivas1999 xQConqueror vaibhav2740
Your approach is right but code is wrong.
Can't you use segment tree to solve it in O(nlogn) ?
No.
yes, you can
Code from, i just subtract the sum of all subarrays of 1 element
https://www.geeksforgeeks.org/sum-of-xor-of-all-subarrays
no thanks to me ?
No