FastPrepFastPrep
Problem Brief

Minimum Cycles

NEW GRADINTERNOA
See Tiktok online assessment and hiring insights

Given an array of n integers, arr, make the values equal using the minimum number of operations.

- Either choose an element and apply the operation:

  • If the operation number is odd (e.g., first, third, fifth,...), then increase the element by 1.
  • If the operation number is even (e.g., second, fourth, sixth,...), then increase the element by 2.
- or do nothing.

Only one element can change in an operation.

Calculate the minimum number of operations required to make all elements equal.

Function Description

Complete the function minimumCycles in the editor.

minimumCycles has the following parameter:

  1. int arr[n]: an array of integers

Returns

int: the minimum number of operations required

1Example 1

Input
arr = [1, 2, 4]
Output
4
Explanation
[1,2,4] 1 -> 4 = 1+2 ( 2 operations) 2 -> 4 = (do nothing operation) + 2 (2 operations) 4 operations total As doing nothing is a considered an operation as well. ***(Credit to chahat ๐Ÿ‘‘)***

Constraints

Limits and guarantees your solution can rely on.

Unknown so far. If you happen to know about it, feel free to contact Groot in our server. TYVM!
public int minimumCycles(int[] arr) {
  // write your code here
}
Input

arr

[1, 2, 4]

Output

4

Sign in to submit your solution.