Minimum Number of K Consecutive Bit Flips

Statement

We are given a binary arrayAn array consisting of 0s and 1s only. nums and an integer k. Our task is to find the minimum number of flipsChanging a 0 to a 1 or a 1 to a 0. needed to make all the bits in the array equal to $1$. However, we can only flip k consecutive bits at a time. So, for a binary array $[1, 1, 0, 0]$ and k = $2$, we can flip the last two bits to get $[1, 1, 1, 1]$. This means we only need a single k flip to turn the entire array into all $1$s.

If nums cannot be converted to an array with all $1$s with the given k, return $-1$.

Constraints:

• $1 \leq$ nums.length $\leq 10^3$

• $1 \leq$ k $\leq$ nums.length

Examples