|All-time Popular Problems|
|Maximum difference between node and its ancestor|
|Delete a node from BST|
|K’th smallest element|
|Detect cycle in a directed graph|
|Element with left side smaller and right side greater|
|Sort The Array|
|Level order traversal Line by Line|
|Add two numbers represented by linked lists|
|Root to leaf path sum|
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.