Max Product Pair in O(n) | Dataford Interview Questions

Given an array, return the pair with maximum product, handling negative values, in O(n). Asked in the Round 2 stage.

Implement maximum_product_pair(nums). The input is an integer array with at least two elements. Return a two-element list containing the values whose product is maximal. If multiple pairs produce the same maximum product, return any one valid pair.

Constraints: 2 <= len(nums) <= 10^4, and -10^9 <= nums[i] <= 10^9.

Constraints

2 <= len(nums) <= 10^4
-10^9 <= nums[i] <= 10^9
The result must contain values from two distinct array positions

Function Signature

def maximum_product_pair(nums):

Your question is Max Product Pair in O(n). 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, return the pair with maximum product, handling negative values, in O(n). Asked in the Round 2 stage.

Constraints: 2 <= len(nums) <= 10^4, and -10^9 <= nums[i] <= 10^9.

Constraints

2 <= len(nums) <= 10^4
-10^9 <= nums[i] <= 10^9
The result must contain values from two distinct array positions

Function Signature

def maximum_product_pair(nums):

Your question is Max Product Pair in O(n). 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.