Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6564 |

@blackshadows | 6400 |

@mb1973 | 5785 |

@Quandray | 5275 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 5074 |

@kirtidee18 | 4639 |

@sanjay05 | 3762 |

@mantu_singh | 3712 |

@gfgaccount | 3627 |

@marius_valentin_dragoi | 3525 |

Complete Leaderboard | |

Handle | Score |

@yaswanthero123 | 625 |

@vikash619 | 611 |

@venkat11803610 | 501 |

@roshan13ar | 396 |

@DevangSingh | 379 |

@ravi11815721 | 312 |

@hrishipangavhane | 286 |

@aryanjain85297 | 280 |

@kommaraju11806903 | 277 |

@infosumitraut | 272 |

@ankitsharma5422 | 256 |

Complete Leaderboard |

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:**

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

**Example 2:**

**Input:
**N=7
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(N^{2}).

**Expected Auxiliary Space:** O(N^{2}).

**Constraints:**

1 ≤ N ≤ 10^{3}

Login 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?

YesLoading...

Sum equals to Sum

...