Problem Brief

Array Transformation Steps (Early Career)

FULLTIMEOA

See Google online assessment and hiring insights

You are given an array, and the task is to determine how many steps it takes to transform an array of all zeros into the given array. In each step, you can add a contiguous sequence of 1's to the array.

1Example 1

Input

array = [2, 1, 0, 2]

Output

Explanation

The transformation can be done in 4 steps as follows:

0000 -> 1100: Add a contiguous sequence of 1's covering the first two elements.
1100 -> 2100: Add a contiguous sequence of 1's covering the first element.
2100 -> 2101: Add a contiguous sequence of 1's covering the fourth element.
2101 -> 2102: Add a contiguous sequence of 1's covering the fourth element again.

Constraints

Limits and guarantees your solution can rely on.

🐻‍❄️🐻‍❄️

Draft autosaves locally

public int transformationSteps(int[] array) {
  // write your code here
}

Input

array

[2, 1, 0, 2]

Output