Approach for the question

[notacoder]

You are given an integer array A of size N. XOR power of any subarray of array A is defined as the xor of all the integers in that subarray. Your task is to find the number of subarrays whose XOR power is any power of 2.
1<=N<=100000
1<=A[i]<=10^9

[Duthomhas]

You know, you’re turning into a real spammer with these competition threads.

I promise you that you’ll get a better adrenaline rush from having figured something out on your own than you will watching tiny numbers grow on competition boards.