Array Rearrangement Optimization | Dataford Interview Questions

In a Confluent configuration comparison, array a contains fixed baseline values and array b contains values that may be rearranged. Rearrange b to maximize the sum of the elements placed against strictly smaller elements in a.

Each element of b can be used once. An element contributes its value to the result only when it is greater than the corresponding element of a; otherwise, it contributes zero. Return the maximum possible sum.

Formal Specification

Implement maximize_winning_sum(a, b), where a and b are arrays of integers with equal length. Return an integer representing the maximum achievable sum. You do not need to return the rearranged array.

Constraints

1 <= len(a) = len(b) <= 2 * 10^5
0 <= a[i], b[i] <= 10^9
A value contributes only when it is strictly greater than its paired baseline
The result fits in a signed 64-bit integer

Function Signature

def maximize_winning_sum(a, b):

Your question is Array Rearrangement Optimization. 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

Formal Specification

Constraints

1 <= len(a) = len(b) <= 2 * 10^5
0 <= a[i], b[i] <= 10^9
A value contributes only when it is strictly greater than its paired baseline
The result fits in a signed 64-bit integer

Function Signature

def maximize_winning_sum(a, b):

Your question is Array Rearrangement Optimization. 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.