Given an initial integer array arr, repeatedly modify the elements simultaneously based on the following rules:

• An element is incremented by $1$ if it is strictly smaller than both its left neighbor and its right neighbor.

• An element is decremented by $1$ if it is strictly greater than both its left neighbor and its right neighbor.

• The first and last elements of the array never change.

This modification process is applied repeatedly until the array stops changing. Return the final modified array.

Constraints:

• $3 \leq$ arr.length $\leq 100$

• $1 \leq$ arr[i] $\leq 100$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.