<p>Given two arrays of integers with equal lengths, return the maximum value of:</p>

<p><code>|arr1[i] - arr1[j]| + |arr2[i] - arr2[j]| + |i - j|</code></p>

<p>where the maximum is taken over all <code>0 &lt;= i, j &lt; arr1.length</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> arr1 = [1,2,3,4], arr2 = [-1,4,5,6]
<strong>Output:</strong> 13
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> arr1 = [1,-2,-5,0,10], arr2 = [0,-2,-1,-7,-4]
<strong>Output:</strong> 20
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>2 &lt;= arr1.length == arr2.length &lt;= 40000</code></li>
	<li><code>-10^6 &lt;= arr1[i], arr2[i] &lt;= 10^6</code></li>
</ul>

class Solution:
    def maxAbsValExpr(self, arr1: List[int], arr2: List[int]) -> int:
        # max1 = max(arr1)
        # min1 = min(arr1)
        # i1 = arr1.index(max1)
        # j1 = arr1.index(min1)

        # max2 = max(arr2)
        # min2 = min(arr2)
        # i2 = arr2.index(max2)
        # j2 = arr2.index(min2)

        # return max((abs(arr1[i1]-arr1[j1])+abs(arr2[i1]-arr2[j1])+abs(i1-j1)), (abs(arr1[i2]-arr1[j2]))+abs(arr2[i2]-arr2[j2])+abs(i2-j2))

        l1 = [arr1[i]+ arr2[i]+ i for i in range(len(arr1))]
        l2 = [arr1[i]- arr2[i]+ i for i in range(len(arr1))]
        l3 = [arr1[i]+ arr2[i]- i for i in range(len(arr1))]
        l4 = [arr1[i]- arr2[i]- i for i in range(len(arr1))]

        return max(map(lambda x: max(x) - min(x), (l1, l2, l3, l4)))
27200