Finding Equi Pair

CodeChefOpen on judge ↗

In a given integer array A of size N, There exists an Equi Pair at (x,y) if and only if A[0] + A[1] + .. + A[x-1] = A[x+1] + A[x+2] + ... + A[y - 1] = A[y+1] + A[y +2] + ... + A[n-1] If the given array has an Equi Pair at (x,y), then output (x,y), else output (-1,-1) Input Format -------------- First Line of the input will contain an integer T to represent T numbers of test cases below E

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI