Sum Pair Maximum Product | Dataford Interview Questions

Given an array of elements, return a pair with maximum product. Handle negative values. Write an O(n) solution.

Asked in the Round 2 stage.

Implement def maximum_product_pair(nums):. The input is a non-empty integer array with at least two elements. Return the two element values forming a pair with the largest product. The pair may be returned in either order, and any pair is valid when multiple pairs have the same maximum product.

Constraints

2 <= len(nums) <= 1000
-10^9 <= nums[i] <= 10^9
Return the values, not their indices
Any pair achieving the maximum product is valid

Function Signature

def maximum_product_pair(nums):

Your question is Sum Pair Maximum Product. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Given an array of elements, return a pair with maximum product. Handle negative values. Write an O(n) solution.

Asked in the Round 2 stage.

Constraints

2 <= len(nums) <= 1000
-10^9 <= nums[i] <= 10^9
Return the values, not their indices
Any pair achieving the maximum product is valid

Function Signature

def maximum_product_pair(nums):

Your question is Sum Pair Maximum Product. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.