sir/maam could you see where the problem is?
also,i think there can be multiple resulting arrays to this problem … how do we know which one to print?
1 Count ... only 1 test case has passed
@imavneet We can solve this problem using two pointers technique. Let us take a subarray [l, r] which contains at most k zeroes. Let our left pointer be l and right pointer be r. We always maintain our subsegment [l, r] to contain no more than k zeroes by moving the left pointer l. Check at every step for maximum size (i.e, r-l+1)