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]$ ...