Sum equals to Sum
Easy Accuracy: 19.84% Submissions: 111 Points: 2

Given an array A of distinct integers. The task is to find if there are two pairs (a, b) and (c, d) such that a+b = c+d, and elements of array are distinct.

Example 1:

arr[] = {3, 4, 7, 1, 2, 9, 8} 
Output: 1
(3, 7) and (9, 1) are the pairs whose
sum are equal.  

Example 2:

arr[] = {65, 30, 7, 90, 1, 9, 8}
Output: 0


Your Task:
Since, this is a function problem. You don't need to take any input, as it is already accomplished by the driver code. You just need to complete the function findPairs() that takes array a and n as parameters and return 1 if pair exists else 0.

Expected Time Complexity: O(N2).
Expected Auxiliary Space: O(N2).

1 ≤ N ≤ 103

to report an issue on this page.


We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?


All Submissions

My Submissions:

Login to access your submissions.