Minimum Operations to Convert Array

Problem Overview

• Convert a given array permutation into (1,2,...,n) using cyclic left shifts by 1 and/or swaps, where after the first swap no more shifts are allowed; minimize operation count.
• Inputs/Outputs: int[] arr (length n, guaranteed permutation); return int via minimumOperationsToConvertArray.
• Context: Array manipulation and optimization problem for coding interview scenarios.
• Company: Nutanix interviews; this is a frequently asked interview question.