> For the complete documentation index, see [llms.txt](https://maksimdan.gitbook.io/interview-practice-problems/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/624-maximum-distance-in-arrays.md).

# 624 Maximum Distance in Arrays

Given m arrays, and each array is sorted in ascending order. Now 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 a and b to be their absolute difference |a-b|. Your task is to find the maximum distance.

**Example 1:**

```
Input: 
[[1,2,3],
 [4,5],
 [1,2,3]]
Output: 4
```

**Explanation:**

* 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.

Note:

* Each given array will have at least 1 number. There will be at least two non-empty arrays.
* The total number of the integers in all the m arrays will be in the range of \[2, 10000].

  The integers in the m arrays will be in the range of \[-10000, 10000].

**The Idea:** Iterate through all n chose 2 combinational rows vectors and iteratively adjust the maximum by the absolute difference between the first and last element from row `i` and `j`, and `j` and `i` given `j > i`.

**Complexity:** O(n^2) time and O(1) space

```cpp
int maxDistance(vector<vector<int>>& arrays) {
    int max_dist = 0;
    for (int i = 0; i < arrays.size(); i++) {
        for (int j = i+1; j < arrays.size(); j++) {
            max_dist = max(max_dist, abs(arrays[i][0] - arrays[j][arrays[j].size() - 1]));
            max_dist = max(max_dist, abs(arrays[j][0] - arrays[i][arrays[i].size() - 1]));
        }
    }

    return max_dist;
}
```


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter, and the optional `goal` query parameter:

```
GET https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/624-maximum-distance-in-arrays.md?ask=<question>&goal=<endgoal>
```

`ask` is the immediate question: it should be specific, self-contained, and written in natural language.
`goal` is optional and describes the broader end goal you are ultimately trying to accomplish on behalf of the user. GitBook uses it to tailor the answer towards what is most useful for that goal.

The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.