Minimum Cycles

Problem Overview

• Given an array of n integers, compute the minimum number of operations to make all values equal.
• In each operation, you may change only one element: odd-numbered operations add 1; even-numbered operations add 2; or you may skip.
• Input: int arr[n]; Output: int minimum operations. Constraints: unspecified.
• Real-world context: balancing array values under alternating step sizes.
• This coding interview problem is a TikTok interview question, asked in TikTok interviews.