Minimum Moves to Sort Array

Problem Overview

• Compute the minimum moves to make an integer array non-decreasing by splitting any element into two parts whose sum equals the original.
• Input: arr[] of N integers. Output: smallest number of moves using that operation; no extra constraints given.
• Reflects array/data processing where totals are preserved via splits.
• Asked in Moveworks interviews; a coding interview problem and interview question on array optimization.