Not passing all testcase

#1
#2

Check your code with the sample test case:
Sample Input

10 2
1 0 0 1 0 1 0 1 0 1

Sample Output

5
1 0 0 1 1 1 1 1 0 1

You output:
5
1 0 0 1 0 1 1 1 1 1

#3

As per hint video i coded plz give some hint how to approach this problem

#4

The idea is to use Sliding Window for the given array. The solution is taken from here. Let us use a window covering from index wL to index wR. Let the number of zeros inside the window be zeroCount. We maintain the window with at most m zeros inside.

The main steps are:

While zeroCount is no more than m: expand the window to the right (wR++) and update the count zeroCount.
While zeroCount exceeds m, shrink the window from left (wL++), update zeroCount;
Update the widest window along the way. The positions of output zeros are inside the best window.

You can refer this https://ide.codingblocks.com/s/266783

#5

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.