Given a Binary string and a number k. our task is to find the Longest continuous sequence of '0' after repeating Given string K time.
Input: the First line of input contains an integer T i.e number of a test case. each test case contains a number K and a Binary String.
print an integer i.e Longest continuous sequence of 0
1<= T <= 100
1<= S <= 10^5
1 <= K <= 10^5
testcase 1 : After repeating given string 3 time, string := 100001100001100001 , now LCS : 4
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.