Problem Description.

Given an array of N integers you find XOR every possible k continous elements in the array.

Input:

5 3

1 2 3 4 5

Output:

0 5 2

Can anyone please help me how could i use sliding window concept here or is there any other method to solve this problem…??