Minimum Operations to Make Array Equal Problem

Minimum Operations to Make Array Equal Problem — ExecCode Easy DSA Practice

Solve the Minimum Operations to Make Array Equal problem on ExecCode. Free online easy DSA practice in Math. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You have an array arr of length n where arr[i] = (2 i) + 1 for all valid values of i (i.e., 0 <= i < n). Your task is to given an integer n, the length of the array, return the minimum number of operations needed to make all the elements of arr equal. In one operation, you can select two indices x and y where 0 <= x, y < n and subtract 1 from arr[x] and add 1 to arr[y] (i.e., perform arr[x] -=1and arr[y] += 1). The goal is to make all the elements of the array equal. It is guaranteed that all the elements of the array can be made equal using some operations.

Examples

Input {"n": 3}; Output 2. Input {"n": 100}; Output 2500. Input {"n": 10000}; Output 25000000

Constraints

1 <= n <= 10^4

Practice Minimum Operations to Make Array Equal free on ExecCode. Browse DSA problems, topic map, and placement guides.