Largest subarray(Problem already exist) (Deleted)
Submissions: 0   Accuracy:

-1%

  Difficulty: Easy   Marks: 2

Given an array containing only 0s and 1s, find the largest subarray which contain equal no of 0s and 1s.

Expected time complexity is O(n).

Input:

The first line of input contains a single integer T denoting the number of test cases. Then T test cases follow. Each test case consist of two lines. The first line of each test case consists of an integer N, where N is the size of array.
The second line of each test case contains N space separated integers denoting array elements.

Output:

Corresponding to each test case, in a new line, print the starting and ending indexes of the  largest subarray which contain equal no of 0s and 1s.

Constraints:

1 ≤ T ≤ 100
1 ≤ N ≤ 500
A[i] = [0,1]

Example:

Input
1
5
1 1 0 0 0

Output
0 3

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

Author: rajatjha


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.