Minimum Number of Operations Problem Statement

Given an array 'ARR' consisting of 'N' positive integers, determine the minimum number of operations needed to make all elements of the array equal. You may use addition, subtraction, multiplication, or division on any array element.

Example:

Input:

ARR = [1,2,3]

Output:

2

Explanation:

By adding 1 to the element with value 1 and subtracting 1 from the element with value 3, the array becomes [2,2,2]. Hence, 2 operations are required.

Constraints:

• 1 <= T <= 10
• 1 <= N <= 10^5
• 0 <= ARR[i] <= 10^5
• Time Limit: 1 sec

Note:

You are not required to print the expected output, it has already been taken care of. Just implement the given function.