Get Minimum Operations to Sort Array

Problem Overview

• Find the minimum number of split operations to sort the array in ascending order.
• Operation: pick arr[i] and split into two positive parts a and b such that a+b=arr[i]; repeat as needed.
• Input: n and arr with 1<=n<=1e5 and 1<=arr[i]<=1e9; Output: minimal operation count.
• Context: array optimization problem relevant to data processing; a common coding interview problem and interview question.
• From Moveworks interviews.