Minimum Moves to Obtain Array

Problem Overview

• Find the minimum moves to turn an all-zero array into target array A, where each move increments all elements in any chosen contiguous interval by 1.
• Input: int[] A (length N). Output: integer minimum moves; start state is an array of N zeros.
• Domain: array transformation via range increments, relevant to batch updates and cumulative operations.
• Asked in Google interviews; a coding interview problem and common interview question on array manipulation.