How should I practice Minimum Moves to Sort Array?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Moveworks online assessment problems in FastPrep.

Is Minimum Moves to Sort Array associated with Moveworks?

FastPrep tags this as a Moveworks coding interview or online assessment practice problem when the problem catalog has that company context.

Problem · Array

Minimum Moves to Sort Array

Learn this problem

● HardMoveworksFULLTIMEINTERNOA

Problem statement

Given an array arr[] of N integers, the task is to find the minimum number of moves to sort the array in non-decreasing order by splitting any array element into two parts such that the sum of the parts is the same as that element.

Function

minimumMovesToSortArray(arr: int[]) → int

Examples

Example 1

arr = [3, 4, 2]return = 2

The moves are:

Split 4 into two parts (2, 2). Array becomes arr[] = {3, 2, 2, 2}
Split 3 into two parts (1, 2). Array becomes arr[] = {1, 2, 2, 2, 2}

Example 2

arr = [3, 2, 4]return = 1

Split 3 into two parts (1, 2). Array becomes (1, 2, 2, 4).

Example 3

arr = [5, 6, 5, 7, 9]return = 2

At Index = 0, 5 breaks into 2, 3 so array becomes (2, 3, 6, 5, 7, 9).
At Index = 1, 6 breaks into 3, 3 so array becomes (2, 3, 3, 3, 5, 7, 9).
Now the array is sorted (2, 3, 3, 3, 5, 7, 9), so the count is 2. Hence the function returns 2.