Given a function that takes a binary string. The task is to return the longest size of contiguous substring containing only ‘1’.
The first line of input contains an integer T denoting the no of test cases.Then T test cases follow. Each test case contains a string S.
For each test case return the maximum length of required sub string.
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.