Minimum Operations Problem Statement

Given an array ARR consisting of N positive integers, your task is to determine the minimum number of operations required to make all elements in the array equal. The operations permitted are addition, multiplication, subtraction, or division on any element of the array.

Example:

Input:

ARR = [1, 2, 3]

Output:

2

Explanation:

One way to make all elements equal is by adding 1 to the element with value 1 and subtracting 1 from the element with value 3, resulting in the array [2, 2, 2].

Constraints:

• 1 <= T <= 10
• 1 <= N <= 105
• 0 <= ARR[i] <= 105, where ARR[i] is the element of the array ARR at index i.
• Time Limit: 1 sec