Pairs With Equal Sum

easy

Hashmap and Heaps

Question Solve Solutions

1. You are given an array(arr) of distinct integers.
2. You have to find if there are two pairs(A, B) and (C, D) present in the given array which satisfies the condition A+B = C+D.

Input Format

A number N arr1 arr2.. N numbers

Output Format

true/false

Constraints

1 <= N <= 10^3
-10^9 <= arr[i] <= 10^9

Example

Input

8
1 2 998 72 87576 21 45 -1

Output

false

Count Of Subarrays With Equal Number Of 0s 1s And 2s

Recurring Sequence In A Fraction

Related Questions

easy Double Pair Array easy Subdomain Visit Count easy Group Anagrams easy Isomorphic Strings easy Valid Anagram easy Longest Subarray With Sum Divisible By K easy The Skyline Problem easy Word Pattern easy Number Of Employees Under Every Manager easy Find Itinerary From Tickets easy Check If An Array Can Be Divided Into Pairs Whose Sum Is Divisible By K easy Largest Subarray With Zero Sum easy Count Distinct Elements In Every Window Of Size K easy Largest Subarray With Contiguous Elements medium Count Of All Subarrays With Zero Sum hard Smallest Substring Of A String Containing All Characters Of Another String