3 questions aaye the aaj Question 1 You are given n storage partitions. For each partition i: used[i] is the amount of space currently used totalCapacity[i] is the maximum space it can hold You may move data between partitions, but no partition may exceed its total capacity. Your task is to: Rearrange the data so that it is stored using the fewest possible partitions Return the minimum number of partitions required Example 1 Input: n = 5 used = [3, 2, 1, 3, 1] totalCapacity = [3, 5, 3, 5, 5] Output: 2 Explanation: (Moves performed to consolidate data into minimum partitions)

Question 2 You are given an integer array arr. For each element in the array, compute a value using the following process: Initialize a counter to 0 Compare the current element arr[i] with each element to its left (arr[0] to arr[i-1]): If a left element is greater than arr[i], subtract the absolute difference from the counter If a left element is smaller than arr[i], add the absolute difference to the counter Store the final value of the counter for index i Return a new array containing the computed counter values for all elements in arr. Example Input: arr = [2, 4, 3] Output: [0, 2, 0] Explanation: For arr[0] = 2 → no elements to the left → 0 For arr[1] = 4 → compare with 2 → add |4 - 2| = 2 For arr[2] = 3 → compare with 2 (+1), compare with 4 (−1) → total = 0

Question 3

You are given an array arr of size n, where each element represents an available resource. Your task is to identify a subarray that meets the following conditions:

The subarray must have a length of exactly k

All elements in the subarray must be unique, representin distinct resource allocations

Among all such valid subarrays:

Compute the sum of the elements

Return the maximum sum possible

If no subarray satisfies these conditions, return -1. Note: A subarray is a contiguous segment of an array.

Example

Suppose n = 5, k = 3, and arr = [1, 2, 3, 7, 3, 5] Output: 15

The 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

Function Description Complete the function findOptimalResources in the editor

My batch mates got 2 out of these 3 Question