If the given array is [1,2,3] then the answer would be 2. One of the ways to make all the elements of the given array equal is by adding 1 to the array element with value 1 and subtracting 1 from the array element with value 3. So that final array would become [2,2,2].
The first line of input contains a single integer 'T', representing the number of test cases. The first line of input contains an integer 'N' representing the length of the array. The second line contains 'N' single space-separated integers representing elements of the array 'ARR'.
For each test case, return an integer in a single line i.e. the minimum number of operations required to make all the elements of the array equal.
You are not required to print the expected output, it has already been taken care of. Just implement the given function.
1 <= T <= 10 1 <= N <= 10^5 0 <= ARR[i] <= 10^5 Where 'ARR[i]' is the element of the array 'ARR' at index 'i'. Time Limit: 1 sec
Ninja And The Strictly Increasing Array
Negative To The End
Sort 0s, 1s, 2s