Closed akshitasinghal4444 closed 2 years ago
I have done a question from gfg named Valid Pair Sum .
In this were given an array of size N and we had to find the number of distinct pairs {i, j} (i != j) in the array such that the sum of a[i] and a[j] is greater than 0.
Please merge this pr into Task 1 .
I have done a question from gfg named Valid Pair Sum .
In this were given an array of size N and we had to find the number of distinct pairs {i, j} (i != j) in the array such that the sum of a[i] and a[j] is greater than 0.
Please merge this pr into Task 1 .