Longest substring with equal number of 0s and 1s
Submissions: 3870   Accuracy:

19.31%

  Difficulty: Easy   Marks: 2

Given a binary string, the task is to find maximum substring length with equal number of 0’s and 1’s.

Input:
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains a binary string.

Output:
For each test case, print the maximum substring length in new line.

Constraints:
1<=T<=100
1<=|String length|<=105

Example:
Input:
2
1100011
0010

Output:
6
2

** For More Input/Output Examples Use 'Expected Output' option **

Author: arun03


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.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.


to report an issue on this page.