There is this online interview question which goes like:
Find the maximum length substring in a binary string, the substring can have atmost k 0’s
eg: input string: 0100111101100101
k: 3
output: 10
Explanation: all the characters from the 4th index till the 13th index are included

Please refer to this image for the 2nd question