Problem Statement

Binary String Examination Problem Description You are given a binary string S of length N. Imagine forming a new string T of length N*K by concatenating K copies of S one after another. Determine the length of the longest run within T made up entirely of '0' characters. Complete the `maxSize` function in the editor below. It has the following parameter(s): N: INTEGER, The size of the given array. K: INTEGER, The number of copies to be made. S: STRING, The given string. The function must return an INTEGER giving the length of the longest all-zero run found within T. Input format for debugging: The first line contains an integer, N, denoting the size of the given array. The next line contains an integer, K, denoting the number of copies to be made. The next line contains a string, S, denoting the given string. Constraints 1 <= N <= 10^5 1 <= K <= N 1 <= len(S) <= 10^5 Examples Example 1: Input: 3 2 000 Output: 6 Explanation: With N=3 and K=2, S is already made up entire