Link to the problem : https://www.codechef.com/AGPR2020/problems/ALPR2005
Given a binary sequence of length $$$n$$$, find the minimum number of changes needed so that bitwise-xor of every subarray of size $$$k$$$ is exactly 1 .
A change operation is defined as : "You can change "1" to "0" , vice-versa"
Similar problem : https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips/
The only thing I could decipher till now is that the answer mainly depends on the first subarrays of size k .