1

# Split Array With Equal Sums

Difficulty: MEDIUM
Avg. time to solve
15 min
Success Rate
85%

Problem Statement
Suggest Edit

#### Example:

``````let 'ARR' = [1, 2, 3] then the possible subarrays of 'ARR' will be - {1}, {2}, {3}, {1, 2}, {2, 3}, {1, 2, 3}.
``````
##### Input format:
``````The first line of input contains an integer ‘T’ denoting the number of test cases to run. Then the test case follows.

The first line of each test case contains an integer  ‘N’ representing the array’s size.

The second line of each test case contains 'N' space-separated integers representing the array’s elements.
``````
##### Output format:
``````For each test case, print ‘True’ if such a triplet exists; else print ‘False’.

Output for each test case will be printed in a separate line.
``````

#### Note:

``````You don’t have to take any input or print anything; it already has been taken care of. Just implement the function.
``````
##### Constraints:
``````1 <= T <= 5
1 <= N <= 10 ^ 3
-10 ^ 6 <= ARR[i] <= 10 ^ 6

Time Limit: 1 sec
``````
##### Sample Input 1:
``````2
7
1 2 1 2 1 2 1
5
1 2 3 1 2
``````
##### Sample Output 1:
``````True
False
``````
##### Explanation For Sample Input 1:
``````In first test case, If we take i = 1, j = 3 and k =5 we get - sum[0,i-1]  -> sum[0,0]=1, sum[i+1, j-1] -> sum[2,2]=1, sum[j+1, k-1] -> sum[4,4]=1, sum[k+1,N-1] -> sum[6,6]=1. Here the sum of all subarrays formed is 1, So, "True" will be printed.

In second test case, here N = 5, the first condition i.e 0 < i, i - 1< j, j - 1 < k, k - 1 < n doesn’t satisfy for any triplet. So "False" will be printed.
``````
##### Sample Input 2:
``````2
6
1 2 1 2 1 2
9
1 2 3 -5 8 1 3 2 3
``````
##### Sample Output 2:
``````False
True
``````
##### Explanation For Sample Input 2:
``````In first test case, we cannot get any triplet as equal sum is not possible. So, "False" is printed.

In second test case, we can get any triplet as equal sum is possible which is 3 by taking i = 2, j = 5 and j = 7. So, "True" is printed.
``````
Console