I recently came across this question. Given an array of integers we have to find the bitwise XOR of bitwise AND of all the subarrays of size atmost K.\n\nINPUT\n\nN = 5\nA = [5,7,8,2,6]\nK = 3\nOUTPUT\n\n9\nExplanation: The possible bitwise AND of subarrays having size atmost 3 are -\n\n[5,5] = 6\n[4,4] = 2 , [4,5] = 2\n[3,3] = 8 , [3,4] = 0 , [3,5] = 0\n[2,2] = 7 , [2,3] = 0 , [2,4] = 0\n[1,1] = 5 , [1,2] = 5 , [1,3] = 0\n\nThe XOR of all ANDS = 6^2^2^8^0^0^7^0^0^5^5^0 = 9.\n\nGiven N <= 1e5 , K <= N , A[i] <= 1e5. Can someone guide on how to solve this problem.

I recently came across this question. Given an array of integers we have to find the bitwise XOR of bitwise AND of all the subarrays of size atmost K.\n\nINPUT\