Minimum Operations to Equalize Array
Given an integer array ARR
of length N
where ARR[i] = (2*i + 1)
, determine the minimum number of operations required to make all the elements of ARR
equal. In a single operation, you can pick two elements i
and j
, increment ARR[i]
by 1, and decrement ARR[j]
by 1.
Input:
The first line contains an integer T
, the number of test cases.
For each test case, there is a single integer N
, the length of the array ARR
.
Output:
Output the minimum number of operations required for each test case on a separate line.
Example:
Input:
T = 2
N = 3
N = 4
Output:
2
4
Explanation:
For N = 3
, the array is [1, 3, 5]
. Two operations are needed to make all elements equal to 3
.
For N = 4
, the array is [1, 3, 5, 7]
. Four operations are needed to make all elements equal to 4
.
Constraints:
1 ≤ T ≤ 1000
1 ≤ N ≤ 109
Note:
You are not required to print anything; just implement the provided function.
Follow-Up:
Consider solving this in constant time and space complexity.
The minimum number of operations required to make all elements of the given array equal.
Calculate the target value as the sum of all elements divided by the length of the array.
Find the absolute diffe...read more
Top Procol Software Developer Intern interview questions & answers
Popular interview questions of Software Developer Intern
Reviews
Interviews
Salaries
Users/Month