Given two integer arrays arr1 and arr2 of equal length, determine the maximum value of the expression:

$|arr1[i] - arr1[j]| + |arr2[i] - arr2[j]| + |i - j|$

where the maximum is computed across all indices $i$ and $j$ such that $0 \le i, j < arr1.length$.

Constraints:

• $2 \le arr1.length == arr2.length \le 40000$

• $-10^6 \le arr1[i], arr2[i] \le 10^6$

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.