Maximum Pairwise Product Problem Find the maximum product of two distinct numbers in a sequence of non-negative integers.
j-p-d-e-v / dsa-maximum-pairwise-product Goto Github PK
View Code? Open in Web Editor NEWMaximum Pairwise Product Problem Find the maximum product of two distinct numbers in a sequence of non-negative integers. Input: An integer n and a sequence of n non-negative integers. Output: The maximum value that can be obtained by multiplying two different elements from the sequence.