|All-time Popular Problems|
|Maximum difference between node and its ancestor|
|Right View of Binary Tree|
|Delete without head pointer|
|Find the number of islands|
|Delete nodes having greater value on right|
|Reverse Level Order Traversal|
|Binary Tree to DLL|
|Find all pairs with a given sum|
|n'th node from end of linked list|
|Equal to product|
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.