Find a pair of integers in an array with the maximum product.

• Iterate through the array and keep track of the maximum and second maximum values.

• Consider negative numbers and zero.

• Time complexity: O(n)