FastPrep
Problem · Array

Maximize Resource Allocation

Learn this problem
● EasyIBMFULLTIMEOA
See IBM hiring insights

Problem statement

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.

Function

maximizeResourceAllocation(arr: int[], k: int) → int

Examples

Example 1

arr = [1, 2, 3, 7, 3, 5]k = 3return = 15
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

🍅🍅

More IBM problems

drafts saved locally
public int maximizeResourceAllocation(int[] arr, int k) {
  // write your code here
}
arr[1, 2, 3, 7, 3, 5]
k3
expected15
checking account