Given an array of distinct integers. The task is to count all the triplets such that sum of two elements equals the third element.
Input Format
Input is managed for you
Output Format
Output is managed for you
Constraints
1 <= N <= 10^3 1 <= arr[i] <= 10^5
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
4 1 5 3 2
Output
2