CareerCup

how to find the fastest xor of large subarray or given range?

print(reduce(xor,arry[qury[1]-1:qury[-1]]))

but it's not working for larger input

Given an array of integers A. calculate the sum of A[i] %A[j] for all possible i,j pair. return sum%(10^9+7) as an output solve this problem on o(n).

input :-
A=[1,2,3]
Output:-
5
Explanation:-
(1%1)+(1%2)+(1%3)+(2%1)+(2%2)+(2%3)+(3%1)+(3%2)+(3%3)