<h2><a href="https://leetcode.com/problems/maximum-distance-in-arrays/">624. Maximum Distance in Arrays</a></h2><h3>Medium</h3><hr><div><p>You are given <code>m</code> <code>arrays</code>, where each array is sorted in <strong>ascending order</strong>.</p>

<p>You can pick up two integers from two different arrays (each array picks one) and calculate the distance. We define the distance between two integers <code>a</code> and <code>b</code> to be their absolute difference <code>|a - b|</code>.</p>

<p>Return <em>the maximum distance</em>.</p>

<p>&nbsp;</p>

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

<pre><strong>Input:</strong> arrays = [[1,2,3],[4,5],[1,2,3]]

<strong>Output:</strong> 4

<strong>Explanation:</strong> One way to reach the maximum distance 4 is to pick 1 in the first or third array and pick 5 in the second array.

</pre>

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

<pre><strong>Input:</strong> arrays = [[1],[1]]

<strong>Output:</strong> 0

</pre>

<p>&nbsp;</p>

<p><strong>Constraints:</strong></p>

<ul>

<li><code>m == arrays.length</code></li>

<li><code>2 &lt;= m &lt;= 10⁵</code></li>

<li><code>1 &lt;= arrays[i].length &lt;= 500</code></li>

<li><code>-10⁴ &lt;= arrays[i][j] &lt;= 10⁴</code></li>

<li><code>arrays[i]</code> is sorted in <strong>ascending order</strong>.</li>

<li>There will be at most <code>10⁵</code> integers in all the arrays.</li>

</ul>

</div>