Given an array, find a pair with sum = k.

• Use a hash table to store the difference between k and each element in the array.

• Iterate through the array and check if the current element is present in the h...read more