Can anyone tell me the approach of this question

You are given two integers N and K.
A string consists of 0 and 1s you can perform the following operations on it in a string S.
Choose a substring K and change ‘0’ to ‘1’ and vice versa in it.

Determine whether it is possilbe to convert every character of the string S to ‘0’.

Constraints:
1<=S.length<=100000
1<=K<=100000

1 Like

This question already has answers here

I think the problem is from some ongoing contest. :joy: :joy:

2 Likes

Lol, I just answered the same problem in a different thread. Is it from some ongoing contest?

@sudo_s @ashish_kaur i have posted my question around 8pm and contest ended at 6:30 pm you can aso check the screenshot below.Capture