The following question was asked in round 1.
Counting Pairs Given An Integer K And A List Of Integers, Count The Number Of Distinct Valid Pairs Of Integers (A, B) In The List For Which A +K= B. Two Pairs Of Integers (A, B) And (Cd) Are Considered Distinct If At Least One Element Of (A, B) Does Not Also Belong To (C,D). Example N=4 Numbers = [1,1, 1, 2] K = 1 This Array Has Two Different Valid