Count pairs in array with sum x

• Iterate through array and store complements in a set

• Check if current number is in set, increment count if so

• Handle duplicates by using a map to store frequency of number...read more