Given a binary string, the task is to find maximum substring length with equal number of 0’s and 1’s.
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.
For each test case, print the maximum substring length in new line.
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.