Problem Brief

Maximize Resource Allocation

FULLTIMEOA

See IBM online assessment and hiring insights

An array of size n represents a set of available resources. Identify a subarray that optimally utilizes these resources under the following constraints:

The subarray must have a specific length, denoted as k.
All elements in the subarray must be unique, representing distinct resource allocations.

The ultimate goal is to find the subarray that maximizes the sum of the allocated resources. Return the sum for that subarray. If it is not possible to allocate resources per the constraints, return -1.

Note: A subarray is a contiguous segment of an array.

1Example 1

Input

arr = [1, 2, 3, 7, 3, 5], k = 3

Output

Explanation

Following are the subarrays of length k = 3 and all elements are distinct:

[1, 2, 3], and 1 + 2 + 3 = 6
[2, 3, 7], sum = 12
[7, 3, 5], sum = 15

Return the maximum sum, 15.

Constraints

Limits and guarantees your solution can rely on.

🍅🍅

Draft autosaves locally

public int maximizeResourceAllocation(int[] arr, int k) {
  // write your code here
}

Input

arr

[1, 2, 3, 7, 3, 5]

Output